Merge sort algorithm is called merge sort because it works on the premise that merging two sorted lists together is the easiest way to create a single sorted list. Merge sort is a divide-and-conquer ...

int[] f = Sort(arr, si, mid);// sort krke new array dega int[] s = Sort(arr, mid + 1, ei);// sort krke new array dega ...