实验2 查找第K小元素的问题重点.docVIP

实验2 查找第K小元素的问题 源代码如下： 下列程序中 1.void SelSort(int * a, int low, int high)为对一个数组进行简单选择排序的函数； 2.int select(int * A, int low, int high, int k,int times,int t)是查找第K小元素的函数，其中查找的结果存于t，参数times为估计执行比较次数的目的而设置并返回； 3.为方便进行简单的分析，为方便演示，设阈值为6。 #include iostream #include cmath using namespace std; void SelSort(int * a, int low, int high) { int t; for(int i=low;ihigh;i++) for(int j=i+1;j=high;j++) if(a[i]a[j]) { t=a[i];a[i]=a[j];a[j]=t; } } int select(int * A, int low, int high, int k,int times,int t) { int p = high-low+1; if (p 6) { SelSort(A, low, high); times=p*(p-1)/2; //简单选择排序的比较次数 t=A[k-1]; return times; } int q = p / 5; int * M = new int [q]; for (int i = 0; i q; i++) { SelSort(A, i*5, i*5+4); M[i] = A[i*5+2]; } times+=q*10;//每5个元素一组排序估计10次，共有q组； int mm; times=times+select(M, 0, q-1, int(ceil(q/2.0)),times,mm); //求中项 int * A1 = new int [p]; int * A2 = new int [p]; int * A3 = new int [p]; int count1 = 0, count2 = 0, count3 = 0; for (int i = low; i = high; i++) { if (A[i] mm) { A1[count1++] = A[i]; } else if (A[i] == mm) { A2[count2++] = A[i]; } else { A3[count3++] = A[i]; } } times+=p;//分3组则有p次，这里p=n次； if (count1 = k) { times=times+select(A1, 0, count1-1, k,times,t); } else if (count1+count2 = k) { t = mm;times+=1; // } else if (count1+count2 k) { times=times+ select(A3, 0, count3-1, k-count1-count2,times,t); // } delete [] M; delete [] A1; delete [] A2; delete [] A3; return times; } int main(void) { int t; int times=0; int g[] = {60, 22223, 111700, 1110, 5766, 9995, 557, 441, 24448, 8837}; cout 数据如下：\n; for (int i = 0; i 10; i++) {