|
Performance Summary
The table bellow is performance summary of the different sorting algorithms
using JDK 1.3.1. The results are recorded as milliseconds for different array sizes
1000 2000 3000 10000 20000 30000
JDK Arrays.sort 17 45 70
Quicksort 16 40 70
Heap Sort 29 76 134
Sell Short 25 81 148
Merge Sort 69 149 241
Insertion Sort 9 34 76
Selection Sort 38 153 347
Bubble Sort 53 217 488
| 