1.就是一个选择排序
#include <iostream>
using namespace std;
int main()
{
int test_num;
cin >> test_num;
for(int i = 0; i < test_num; ++i)
{
int a[100] = {0};
int n;
cin >> n;
for(int j = 0; j < n; ++j)
{
cin >> a[j];
}
int k, l, m, g = 0,temp;
for(k = 0; k < n; ++k)
{
l = k;
for(m = l;m < n; ++m)
{
if(a[m] < a[l])
{
l = m;
if(l != k)
++g;
}
}
if(l != k)
{
temp = a[l];
a[l] = a[k];
a[k] = temp;
}
}
cout << g << endl;
}
return 0;
}