Computer scienceAlgorithms and data structuresAlgorithmsArray algorithmsSorting algorithms

Merge sort

Merge statements

Report a typo

Select correct statements about merge sort.

Select one or more options from the list

The merge operation takes two sorted arrays and produces a new sorted array containing all elements from both input array.

The worst-case time complexity is O(n log n) where n is the length of the input array.

The bottom-up implementation recursively divides the given array into two subarrays until there is only 1-element subarray remaining.

Merge sort is unstable.

Create a free account to access the full topic