求排序需要交换的次数

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int n,Line[10005],t,cont;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&Line[i]);
    cont = 0;
    for(int i=1;i<=n;i++)
    {
        while(Line[i]!=i)
        {
            int k = Line[i];
            t = Line[i];
            Line[i] = Line[k];
            Line[k] = t;
            ++cont;
        }
    }
    printf("%d\n",cont);
    return 0;
}

 

转载于:https://www.cnblogs.com/Leozi/p/10835228.html