if it is only one element in the list it is already sorted, return.
Step 2 − divide the list recursively into two halves until it can no more be divided.
Step 3 − merge the smaller lists into new list in sorted order.
Select one:
a. Insertion Sort
b. Quick Sort
c. Selection Sort
d. Merge Sort
D. Merge sort
Обсуждают сегодня