All impl and performance test for algorithm of the teaching material DataStructure writen by Weimin Yan.
The performance test includes include different sort algorithm with different input, the result may be:
| binary_insertion | bubble | heap | merging | quick2 | quick | shell | simple_selection | straight_insertion | system | |
|---|---|---|---|---|---|---|---|---|---|---|
| l_asc | 2.00 | 161.00 | 3.00 | 3.00 | 3.00 | 181.00 | 2.00 | 173.00 | 1.00 | 2.00 |
| l_desc | 183.00 | 283.00 | 3.00 | 3.00 | 3.00 | 175.00 | 25.00 | 166.00 | 191.00 | 2.00 |
| l_random | 93.00 | 331.00 | 3.00 | 4.00 | 3.00 | 3.00 | 14.00 | 172.00 | 95.00 | 3.00 |
| l_same | 2.00 | 160.00 | 2.00 | 3.00 | 190.00 | 180.00 | 2.00 | 172.00 | 1.00 | 2.00 |
| s_asc | 18.00 | 17.00 | 18.00 | 20.00 | 19.00 | 19.00 | 18.00 | 17.00 | 16.00 | 17.00 |
| s_desc | 19.00 | 19.00 | 19.00 | 20.00 | 19.00 | 20.00 | 18.00 | 17.00 | 19.00 | 21.00 |
| s_random | 18.00 | 18.00 | 19.00 | 20.00 | 19.00 | 18.00 | 17.00 | 17.00 | 17.00 | 19.00 |
| s_same | 18.00 | 18.00 | 17.00 | 21.00 | 20.00 | 18.00 | 17.00 | 19.00 | 15.00 | 18.00 |
$ git clone https://github.com/yuandong1222/Algorithm.git
$ cd Alogrithm
$ vim makefile and replace PROBLEM and SOLUTION to what you want
$ make run_test
$ make run_performance_test