Description: Using a simple array to achieve the following variety of sorting algorithms, and compare. Sorting algorithms: insertion sort, shell sort, bubble sort 4, the quicksort 5, simple select 6 sort, heap sort, merge sort, radix sort requirements: one, the test data is divided into three categories: positive sequence , reverse, random data for these three types of data, compare the number of keywords in the comparison of the sorting algorithm and the number of moves (where the key exchange is counted as three times a mobile). 3, three types of data, different algorithms in the comparison of the sorting algorithm execution time, accurate to the microsecond
To Search:
File list (Check if you may need any files):
paixu\1.h
.....\Debug\main.obj
.....\.....\paixu.exe
.....\.....\paixu.ilk
.....\.....\paixu.pch
.....\.....\paixu.pdb
.....\.....\vc60.idb
.....\.....\vc60.pdb
.....\main.cpp
.....\paixu.dsp
.....\paixu.dsw
.....\paixu.ncb
.....\paixu.opt
.....\paixu.plg
.....\Debug
paixu
Download