Computer scienceAlgorithms and data structuresAlgorithmsArray algorithmsSorting algorithms

Merge sort

Statements

Report a typo

Select one correct statement about merge sort.

Select one option from the list

The bottom-up and the top-down implementations have the same worst-case time complexity.

The merge operation can merge subarrays only with the same size.

The merge operation takes two unsorted arrays and produces a new sorted array containing exactly half of the elements from both input array.

Merge sort is unstable.

Create a free account to access the full topic