[tag]
Code:
Do you know if Merge Sort is supposed to be quicker than Quick??
Look at the output of my project:
Sorting in progress: Please wait
***************************************************
Sort Type # of Elements Time(s)
-------- ------------------- -------
Quick 5000 0
Merge 5000 0
Heap 5000 0
Insertion 5000 0.015
Quick 10000 0
Merge 10000 0
Heap 10000 0.016
Insertion 10000 0.062
Quick 15000 0
Merge 15000 0
Heap 15000 0.016
Insertion 15000 0.156
Quick 20000 0
Merge 20000 0
Heap 20000 0
Insertion 20000 0.203
Quick 25000 0.016
Merge 25000 0
Heap 25000 0
Insertion 25000 0.313
Quick 30000 0.015
Merge 30000 0
Heap 30000 0
Insertion 30000 0.469
Quick 35000 0
Merge 35000 0
Heap 35000 0.016
Insertion 35000 0.64
Quick 40000 0.016
Merge 40000 0
Heap 40000 0.016
Insertion 40000 0.828
Quick 45000 0.015
Merge 45000 0
Heap 45000 0.016
Insertion 45000 1.078
Quick 50000 0.016
Merge 50000 0
Heap 50000 0.015
Insertion 50000 1.36
Quick 55000 0.015
Merge 55000 0
Heap 55000 0.016
Insertion 55000 1.672
Quick 60000 0.015
Merge 60000 0
Heap 60000 0.015
Insertion 60000 2.094
Quick 65000 0.015
Merge 65000 0
Heap 65000 0.032
Insertion 65000 2.531
Quick 70000 0.016
Merge 70000 0
Heap 70000 0.016
Insertion 70000 2.891
Quick 75000 0.016
Merge 75000 0
Heap 75000 0.031
Insertion 75000 3.281
Quick 80000 0.015
Merge 80000 0
Heap 80000 0.032
Insertion 80000 4.062
Quick 85000 0.016
Merge 85000 0
Heap 85000 0.032
Insertion 85000 4.953
Quick 90000 0.015
Merge 90000 0
Heap 90000 0.031
Insertion 90000 6.063
Quick 95000 0.016
Merge 95000 0
Heap 95000 0.031
Insertion 95000 7.171
Quick 100000 0.032
Merge 100000 0
Heap 100000 0.047
Insertion 100000 8.703
[/tag]