Merge Sort Algorithm

The merge sort algorithm is a comparison-based sorting algorithm based on divide and conquer strategy. It has a usual performance of Θ(nlogn).

The average case time complexity is O(N log N) and the auxiliary space complexity is O(1) using linked lists.

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/merge-sort/