Description: Using the random function generates a random integer N (N = 500,1000,1500,2000,2500, ..., 30000), using direct insertion sort, binary insertion sort, bubble sort, quick sort, select, sort, heap sort, radix sort Seven sorting method (you can add other sorting methods) sort (ascending order of results), and statistics for each time-consuming sorting (ie, the number of comparisons)** and** the number of exchanges. [Basic requirements] (1) the existence of the original data file, each integer line, easy to read. (2) Each screen displays the number of comparisons spent sorting.
To Search:
File list (Check if you may need any files):
sort\sort.ncb
....\sort.plg
....\sort.txt
....\sort.dsp
....\sort.cpp
....\sort.opt
....\sort.dsw
....\Debug\vc60.idb
....\.....\vc60.pdb
....\.....\sort.exe
....\.....\sort.pdb
....\.....\sort.ilk
....\.....\sort.pch
....\.....\sort.obj
....\Debug
sort
Download