Problem: Computer Science
Method
|
ms
|
Moves
|
Comparisons
|
1
|
23
|
8130
|
14765
|
2
|
38
|
19952
|
8732
|
3
|
42
|
27222
|
16814
|
4
|
291
|
719634
|
240871
|
5
|
208
|
2997
|
499500
|
6
|
380
|
719634
|
499500
|
Determine the sorting method using the table. (quick, heap, selection, bubble, insertion, merge sort). Assume all methods are sorting the same list of 1000 integers.