An implementation of 6 sorting algorithms:
- Insertion Sort
- Merge Sort
- Heap Sort
- Quicksort with Hoare partition
- Quicksort with Median partition
- Quicksort with Random partition
Current Result of the 6 sorting algorithms:
| Insertion Sort | 345 810 ms |
| Merge Sort | 196 ms |
| Heap Sort | 196 ms |
| Quicksort with Hoare partition | 116 ms |
| Quicksort with Median partition | 113 ms |
| Quicksort with Random partition | 110 ms |
| Test input | 1 000 000 random integers. Each integer is 16-bits size. Source code is compiled using -O2 flag |
| Test output | Everage time of 3 tests with different random integers |
| Test environment |
Processor: Intel Core i5 CPU M 430 @ 2.27GHz × 4 Memory: 3.7 GiB OS: Ubuntu 12.04 - 64bits |