Divide and Conquer
Level:- 1
Write a program to implement merge sort.
public class Merge {
public static void MergeSort(int arr[], int si, int ei) {
if (si >= ei) {
return;
}
int mid = si + (ei - si) / 2;
MergeSort(arr, si, mid);//left ...
farazalam2017.hashnode.dev2 min read