用LUA（和C++）刷PAT (Advanced Level) ——1067 Sort with Swap(0, i)

#include <iostream>

using namespace std;

int main()
{
    int N, count = 0;
    int numbers[100000];
    cin>>N;
    for(int i = 0; i < N; i++){
        scanf("%d", &(numbers[i]));
    }
    int i = 0;
    while(true){
        if (numbers[0] == 0){
            for(; i < N; i++)
                if(numbers[i] != i)
                    break;
            if(i>=N)
                break;
            numbers[0] = numbers[i];
            numbers[i] = 0;
            count++;
        }
        else{
            int temp = numbers[0];
            numbers[0] = numbers[temp];
            numbers[temp] = temp;
            count++;
        }
    }
    cout<<count;
}