Match the descriptions to these comparison sorting terms: Merge sort, Quicksort, Heapsort, Insertion sort.

Comparison sortingConcept relationships

Choose a match for every item. Use each answer once.

Insertion sort shifts larger prefix elements to make room for the selected value.

Quicksort depends on partitioning, with performance influenced by how balanced the partitions become.

Heapsort uses heap order to select each next element without requiring a separate full sort.

Merge sort's merge step creates a sorted result from two already sorted parts.