## Sort an integer array using mergesort algorithm in java (with example)

What is merge sort algorithm? Merge sort(or MergeSort) is efficient, comparison based algorithm. The properties of merge sort algorithm are as follows: MergeSort is divide and conquer algorithm. MergeSort is a stable algorithm, the relative order of equal keys does not changed during sorting. MergeSort requires additional O(n) space, so its not recommended for large… Read More »