数据结构6种算法排序.doc

排序测试代码：#include#include#included_random.h#included_timer.husing namespace std;/#define Num 5000;template 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 (arrj arrsmallIndex)smallIndex = j;if (smallIndex != pass)temp = arrpass;arrpass = arrsmallIndex;arrsmallIndex = temp