⊛ first we start a loop and find the current element at i = 1 and then by comparing elements we insert an element at particular position. ⊛ And then we recursive call for (N - 1) & (i + 1), and if n ...

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