Skip to content

Added MergeSort in Java. #99

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
udayvig wants to merge 1 commit into from
Closed

Added MergeSort in Java. #99

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
62 changes: 62 additions & 0 deletions sorting/Java/MergeSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,62 @@
public class MergeSort {

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s = new Scanner(System.in);
System.out.println("Enter size: ");
int n = s.nextInt();
int[] arr = new int[n];
System.out.println("Enter elements: ");
for (int i = 0; i < n; i++) {
arr[i] = s.nextInt();
}
int ans[] = mergesort(arr, 0, arr.length - 1);
for (int i = 0; i < ans.length; i++) {
System.out.println(ans[i] + " ");
}
}

public static int[] mergesort(int[] arr, int low, int high) {
if (low == high) {
int[] base = new int[1];
base[0] = arr[low];
return base;
}
int mid = (low + high) / 2;
int[] fhalf = mergesort(arr, low, mid);
int[] shalf = mergesort(arr, mid + 1, high);
int[] sorted = merge(fhalf, shalf);
return sorted;
}

public static int[] merge(int[] arr1, int[] arr2) {
int[] arr3 = new int[arr1.length + arr2.length];
int i = 0, j = 0, k = 0;
while (i < arr1.length && j < arr2.length) {
if (arr1[i] > arr2[j]) {
arr3[k] = arr2[j];
k++;
j++;
} else {
arr3[k] = arr1[i];
k++;
i++;

}
}
while (i < arr1.length) {
arr3[k] = arr1[i];
i++;
k++;
}
{
while (j < arr2.length) {
arr3[k] = arr2[j];
k++;
j++;
}
}
return arr3;

}
}