Scribd
Upload
17 views3 pages

MERGE

The document describes a merge sort algorithm. It defines a MergeSort class with methods for merging, sorting, and printing arrays. The main method sorts a sample integer array using the merge sort algorithm and prints the output.

Uploaded by

abhi786ggjj
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
17 views3 pages

MERGE

The document describes a merge sort algorithm. It defines a MergeSort class with methods for merging, sorting, and printing arrays. The main method sorts a sample integer array using the merge sort algorithm and prints the output.

Uploaded by

abhi786ggjj
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
You are on page 1/ 3

LAB_03

BY-221B310
PROBLEM NO. 01>>>>>>

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;

int 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 - l) / 2;

sort(arr, l, m);

sort(arr, m + 1, r);

merge(arr, l, m, r);

static void printArray(int arr[])

int n = arr.length;

for (int i = 0; i < n; ++i)

System.out.print(arr[i] + " ");

System.out.println();

}
public static void main(String args[])

int arr[] = { 100,22,45,75,5,12};

System.out.println("Given array is");

printArray(arr);

MergeSort ob = new MergeSort();

ob.sort(arr, 0, arr.length - 1);

System.out.println("\nSorted array is");

printArray(arr);

OUTPUT=>

You might also like