Among Selection Sort, InsertionSort, MergeSort, QuickSort, and HeapSort, which algorithm would you use for each list-sorting situation below? Justify your answers. A question might have multiple right answers, but each definitely has at least one wrong answer. (a) The list has several hundred records. The records are quite long, but the keys are very short.

a)The list has several hundred records. The records are quite long, but the keys are very short. ->Selection Sort or Insertion sort.Because the data to be sorted in the memory of the computer and need to be accessed as fast as it can. In this case the keys are small so can be easily compared with each other and can be placed in correct position.The small size of the key helps us in this case to use insertion or selection sort.

Martebi Martebi · Answer 2 · 2021-12-03T16:27:34+01:00

Sorting is simply known as the act, operation or technique of rearranging sets of data in the order that is needed by the user The list has several hundred records. The records are quite long, but the keys are very short-

Selection Sort or Insertion sort.

Selection Sort or Insertion sort is used because the data to be sorted into pieces that can fit into a processors main memory and it can be accessed at anytime.

Heap Sort is also one of the best sorting methods often used too and it does not have a quadratic worst-case scenarios. a sorted array here is made by repeatedly removing the largest/smallest element.

Learn more from

https://brainly.com/question/15565092