For each of the following situations, choose the sorting algorithm we studied that will perform the best. (For some questions, more than one answer might be acceptable, but you only need to list one.) We are working on an unstable system. When we try to run our sort on large arrays, sometimes the sorting algorithm will be forced to stop running in the middle of execution. (The array will be left in whatever state it was in at the time the algorithm stopped.) But we can start the algorithm over and run it again later. So we want to choose an algorithm that will make progress toward the goal even if it does not always finish executing.
(checkbox format)
Insertion sort
Selection sort
Heap sort
Merge sort