排序算法源代码汇总！

/*
Kevin
taorundong@gmail.com
*/

/*
Sort algorithm comparison:  time
Insertion sort:          500
Bubble sort:             1000
Merge sort:              17
Select sort:             500
*/


/*
Analyzing algorithms in windows (version dependency unknow)
精确到微秒

2009-5-26 12:18
Kevin
*/
LARGE_INTEGER tm, tm1, tm2;
QueryPerformanceCounter(&tm1);
//do algorithms
QueryPerformanceCounter(&tm2);
QueryPerformanceFrequency(tm);
tm.QuadPart /= 1000000;
printf("%d\n", (tm2.QuadPart - tm1.QuadPart) / tm.QuadPart);

//精确到毫秒

DWORD tick = 0;
tick = GetTickCount();
//do algorithms
tick = GetTickCount() - tick;
printf("%d\n", tick);

/*
Analyzing algorithms in windows (version dependency unknow)
*/
LARGE_INTEGER tm, tm1, tm2;
QueryPerformanceCounter(&tm1);
//do algorithms
QueryPerformanceCounter(&tm2);
QueryPerformanceFrequency(tm);
tm.QuadPart /= 1000000;
printf("%d\n", (tm2.QuadPart - tm1.QuadPart) / tm.QuadPart);

//Create a random interger array
void CreateRandomIntArray(int *&pArray, unsigned uSize)
{
srand((unsigned) time(NULL));  //set the random time seed

for(unsigned i = 0; i < uSize; ++i)
{
*(pArray + i) = rand();
}
}

1 
/*