选择排序

void selictionSort(int A[], const int N){int *TemArray = new int[N];//----存储有序,副本intmaxIX = 0,//----存最大数的tempIX = 0;//----副本迭代下标do{int max = -1000;for (int i = 0; i< N; i++)if (A[i]>max){max = A[i];maxIX = i;}TemArray[tempIX++] = max;A[maxIX] =-1000;} while (tempIX < N);for (int i = 0; i < N; i++)A[i] = TemArray[N-i-1];delete[]TemArray;}