Computer scienceAlgorithms and data structuresAlgorithmsArray algorithmsSorting algorithms

Merge sort

Implementations

Report a typo

As mentioned in the theory, merge sort algorithm has numerous implementations. What characterizes best each one of them?

Match the items from left and right columns
Top-down
Bottom-up
In-place
Hybrid
recursive implementation
eliminates the need for extra memory
iterative implementation
combination of insertion sort and merge sort

Create a free account to access the full topic