Computer scienceAlgorithms and data structuresAlgorithmsArray algorithmsSorting algorithms

Merge sort

More statements

Report a typo

Read carefully, and choose only the right ones.

Select one or more options from the list

Merge sort is stable.

Time complexity of merge sort is O(n^2) where n is the input size.

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

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

Create a free account to access the full topic