Among Selection Sort, Insertion Sort, Mergesort, Quicksort, and Heapsort, which algorithm would you choose for the situation below? The simplicity of implementation should also be considered AFTER the consideration of speed, the number of assignment operation and the extra space requirement. A) The list has about 25,000 records. It is desirable to complete the sort as quickly as possible on the average, but it is also critical that the sort be completed quickly in every single case. B) The list has about 45,000 records. It is necessary that the sort be completed reasonably quickly in all cases. There is barely enough memory to hold the 45,000 records C) The list has about 45,000 records, but it starts off only slightly out of order. D) The list has several hundred records. The records are quite long, but the keys are very short.
Among Selection Sort, Insertion Sort, Mergesort, Quicksort, and Heapsort, which
A) The list has about 25,000 records. It is desirable to complete the sort as quickly as possible on the average, but it is also critical that the sort be completed quickly in every single case.
B) The list has about 45,000 records. It is necessary that the sort be completed reasonably quickly in all cases. There is barely enough memory to hold the 45,000 records
C) The list has about 45,000 records, but it starts off only slightly out of order.
D) The list has several hundred records. The records are quite long, but the keys are very short.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
