Question

Which sorting algorithm is LEAST efficient when performed on an array in which the values are already in the desired sorted order

Answer 1

Merge sort

Step-by-step explanation:

The various types of sorting algorithms are

1. Quick sort

2. Bubble sort

3. Selection sort

4. Insertion sort

5. Merge sort

6. Heapsort

The algorithm that performs best for an already sorted list is the insertion sort

While the algorithm that performs worse for an already sorted list is the merge sort since it divides the sorted list into sub list before it operations