Scribd
Upload
3 views3 pages

Java Merge Sort Implementation

Uploaded by

vibesofcollege
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views3 pages

Java Merge Sort Implementation

Uploaded by

vibesofcollege
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

import [Link].

Scanner;

public class MergeSort {


void merge(int arr[], int l, int m, int r) {
int n1 = m - l + 1;
int n2 = r - m;
int L[] = new int[n1];
int R[] = new int[n2];
for (int i = 0; i < n1; i++)
L[i] = arr[l + i];
for (int j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
int i = 0, j = 0, k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
} else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void sort(int arr[], int l, int r) {
if (l < r) {
int m = (l + r) / 2;
sort(arr, l, m);
sort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Enter number of elements: ");
int n = [Link]();
int arr[] = new int[n];
[Link]("Enter elements:");
for (int i = 0; i < n; i++)
arr[i] = [Link]();
MergeSort ob = new MergeSort();
[Link](arr, 0, n - 1);
[Link]("Sorted Array:");
for (int x : arr)
[Link](x + " ");
[Link]();
}
}
Enter number of elements: 6
Enter elements:
12 11 13 5 6 7
Sorted Array:
5 6 7 11 12 13

You might also like