Minimumm sort tryed

int minimumSwaps(vector<int> arr) {
    
    int i,c=0,n=arr.size();
    for(i=0;i<n;i++)
    {
        if(arr[i]==(i+1))
            continue;
        
        swap(arr[i],arr[arr[i]-1]);
        c++;
        i--;
    }
    return c;

}

Source: hackerrank.com

Similar codes

0 vote146 views1 answer
How to create a min priority queue of pair of int, int
C++
0 vote159 views1 answer
C++ sudoku solver
C++
0 vote151 views1 answer
Balanced brackets hackerrank solution c++
C++
0 vote141 views1 answer
How to fixed how many digit will be after point in c++
C++
13 votes154 views3 answers
C++ remove last element from vector
C++
0 vote155 views1 answer
How to use a non const function from a const function
C++
0 vote149 views1 answer
Argument to number C++
C++
26 votes174 views2 answers
Remove from vector by value c++
C++
0 vote141 views1 answer
How to make a c++ iostream program restart when finished
C++
12 votes168 views4 answers
Sort function descending c++
C++