Merge Sort Code | DSA

Merge Sort code in Java

Check out our courses:

Coupon: TELUSKO10 (10% Discount)

Coupon: TELUSKO20 (20% Discount)

For More Queries WhatsApp or Call on : [phone]

Udemy Courses:

[vishwajeetrupnar]

Great only tutorial where you explain the code in correct way, whereas others break it in to two parts but according to the the code first left section has to be broken and then merged.
Great!!.

[whitenoisefocus]

Hello 👽(Navin), I'm looking at your videos and now that you've fixed all the holes in my Java, I need some API help as well. Any Rest Assured series in the works? Or do I need to buy a course? I would consider it but can't figure out how much they cost. Or what currency your using. Please finish the DS/ALGO series first though please. 🙏👾

[godFrnd]

Thanks. it is helpful to understand merge sort easy way.

[priyankamagar]

Please Azure, cloud k video upload kro sir

[shawnmark]

The merge method is called one time it is not calling itself then how is multiple merge operations take place
Please explain 🙏🙏🙏

[swapnil]

public class MergeSort2 {
static void mergesort(int[] ar, int l, int r) {
if (l < r) {
int mid = (l + r) / 2;
mergesort(ar, l, mid); // Sort the left half
mergesort(ar, mid + 1, r); // Sort the right half
merge(ar, l, mid, r); // Merge the sorted halves
}
}

static void merge(int[] ar, int l, int mid, int r) {
int n1 = mid - l + 1;
int n2 = r - mid;
int[] lar = new int[n1];
int[] rar = new int[n2];

for (int i = 0; i < n1; i++) {
lar[i] = ar[l + i];
}
for (int i = 0; i < n2; i++) {
rar[i] = ar[mid + 1 + i];
}

int s = 0, t = 0, u = l;

while (s < n1 && t < n2) {
if (lar[s] <= rar[t]) {
ar[u] = lar[s];
s++;
} else {
ar[u] = rar[t];
t++;
}
u++;
}

while (s < n1) {
ar[u] = lar[s];
u++;
s++;
}

while (t < n2) {
ar[u] = rar[t];
u++;
t++;
}
}

public static void main(String[] args) {
int[] ar = {12, 1, 23, 57, 27, 37, 3, 8, 9, 17, 72};

System.out.println("Original array:");
for (int e : ar) {
System.out.print(e + " ");
}
System.out.println();

mergesort(ar, 0, ar.length - 1);

System.out.println("\nSorted array:");
for (int e : ar) {
System.out.print(e + " ");
}
}
}