数据结构种算法排序.docVIP

排序测试 代码： #includeiostream #includevector #included_random.h #included_timer.h using namespace std; //#define Num 5000; template typename T void selectionSort(T arr[], int n) { int smallIndex; int pass, j; T temp; for (pass = 0; pass n-1; pass++) { smallIndex = pass; for (j = pass+1; j n; j++) if (arr[j] arr[smallIndex])smallIndex = j; if (smallIndex != pass){ temp = arr[pass]; arr[pass] = arr[smallIndex]; arr[smallIndex] = temp; } } } template typename T void insertionSort(vectorT v) { int i, j, n = v.size(); T temp; for (i = 1; i n; i++) { j = i; temp = v[i]; while (j 0 temp v[j-1]){ v[j] = v[j-1]; j--; } v[j] = temp; } } //template typename T void exchangesort(vectorint v) { int vsize=v.size(), temp,pass,i; for(pass=0;passvsize-1;pass++) for( i=pass;ivsize;i++) if(v[pass]v[i+1]){ temp=v[pass]; v[pass]=v[i+1]; v[i+1]=temp; } } void bubblesort(vectorint v) { int temp,n=v.size(),i,j; for( i=1;in;i++) { for(j=0;jn-i;j++) if(v[j]v[j+1]) { temp=v[j]; v[j]=v[j+1]; v[j+1]=temp; } } } template typename T int pivotIndex(vectorT v, int first, int last) { int mid, scanUp, scanDown; T pivot, temp; if (first == last) return last; else if (first == last-1) return first; else { mid = (last + first)/2; pivot = v[mid]; v[mid] = v[first]; v[first] = pivot; scanUp = first + 1; scanDown = last - 1; while(scanUpscanDown) { while (scanUp =scanDown v[scanUp] pivot) scanUp++; while (scanUp =scanDown pivot v[scanDown]) scanDown--; if (scanUp scanDown){ temp = v[scanUp]; v[scanUp] = v[scanDown]; v[scanDown] = temp; } } v[first] = v[scanDown]; v[scanDown] = pivot; return scanDown; } } templat