Can someone please explain this to me? Examine the steps of the following algori

Question

Can someone please explain this to me?

Examine the steps of the following algorithm and write the name of the algorithm described in the blank provided:

Recursively divide an array into two equal halves.

Once the array can no longer be subdivided, put the halves back together; while doing so, sort the halves into a temporary array.

Copy the temporary array back into the original array.

insertion sort

selection sort

shell sort

merge sort

quicksort

radix sort

insertion sort

selection sort

shell sort

merge sort

quicksort

radix sort

Explanation / Answer

Recursively divide an array into two equal halves.Once the array can no longer be subdivided, put the halves back together; while doing so, sort the halves into a temporary array.Copy the temporary array back into the original array.

Ans: Merge sort.

Merge sort divides given array in two halves and then calls two halves,after that merges two sorted halves.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects