Print all possible permutation of elements

  HERE IS THE CODE

#include<bits/stdc++.h>
using namespace std;
int arr[1000], n;
vector<int> v;
map<int, bool> mpp;
void permute(vector<int> &v, map<int, bool> &mpp) {
    if (v.size() == n) {
        for(auto it: v) {
            cout<<it<<" ";
        }
        cout<<"\n";
    }
    for (int i=0;i<n;i++) {
    cout<<mpp[i];
        if (mpp[i] == true) {
            continue;
        }
        v.push_back(arr[i]);
        mpp[i] = true;
        permute(v, mpp);
        mpp[i] = false;
        v.pop_back();
    }
}
int main() {
cin>>n;
for(int i=0;i<n;i++) {
    cin>>arr[i];
}
permute(v, mpp);
return 1;
}