Introduction - If you have any usage issues, please Google them yourself
Insertion Sort test average run time 1) for each while loop to generate 0,1, ..., n-1 random order 2) of each cycle while, at least 20 randomly generated order, and sort, at least spend 10 the clock ticking 3) Sort by time divided by the number of random order, the average run time
Packet : 57578889rand.rar filelist
rand\charu.cpp
rand\charu.dsp
rand\charu.dsw
rand\charu.ncb
rand\charu.opt
rand\charu.plg
rand\Debug\charu.exe
rand\Debug\charu.ilk
rand\Debug\charu.obj
rand\Debug\charu.pch
rand\Debug\charu.pdb
rand\Debug\rand.exe
rand\Debug\rand.ilk
rand\Debug\rand.pch
rand\Debug\rand.pdb
rand\Debug\vc60.idb
rand\Debug\vc60.pdb
rand\rand.dsp
rand\rand.plg
rand\Debug
rand