<ul><li>Merge Sort is a divide-and-conquer based algorithm.</li><li>It sorts an array by dividing it into smaller halves and merging them.</li><li>It follows three steps - Divide, Conquer and Combine.</li><li>Divide the array into half recursively till we get only single elements.</li><li>Sort the left and right part of the array recursively.</li><li>Combine the left and right part into single sorted array.</li><li>The time complexity of merge sort is O(n log n).</li><li>A C implementation of merge sort with input/output example is provided.</li><li>The merge sorted array function merges two sorted arrays.</li><li>This summarizes the various steps to perform Merge Sort algorithm.</li></ul>

Sorting algorithm 4: Merge Sort

Discover more