Skip to content

Implemented Merge Sort in Java #229

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

Open
Jagannath8 wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Implemented Merge Sort in Java #229

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f35f2da
Added Merge Sort
Jagannath8 Oct 4, 2023
6b0fa26
Update README.md
Jagannath8 Oct 4, 2023
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
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -287,7 +287,7 @@ You can contribute to any open source project hosted on Github.com and contribut
| Longest Common Subsequence | | | | | | | | | |
| Longest Increasing Subsequence | | :white_check_mark: | | | | | | | |
| Longest Palindromic Substring | | :white_check_mark: | | | | | | | |
| Merge Sort | :white_check_mark: | :white_check_mark: | | :white_check_mark: | | | | | TS |
| Merge Sort | :white_check_mark: | :white_check_mark: | :white_check_mark: | :white_check_mark: | | | | | TS |
| Naive Search | | | | | | | | | |
| Quick Sort | | :white_check_mark: | :white_check_mark: | :white_check_mark: | | | | | |
| Radix Sort | | | | | | | | | |
Expand Down
64 changes: 64 additions & 0 deletions algorithms/java/merge_sort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,64 @@
import java.io.*;
public class MergeSort{
void merge(int arr[], int l, int m, int r){
// Your code here
int[] mix = new int[r-l+1];
int i = l;
int j = m+1;
int k = 0;
while(i <= m && j <= r) {
if(arr[i] <= arr[j]) {
mix[k] = arr[i];
i++;
}
else {
mix[k] = arr[j];
j++;
}
k++;
}

while(i <= m) {
mix[k] = arr[i];
i++;
k++;
}

while(j <= r) {
mix[k] = arr[j];
j++;
k++;
}

for(i=0;i<mix.length;i++) {
arr[l+i] = mix[i];
}
}

void mergeSort(int arr[], int l, int r){
if(r > l) {
int m = l + (r-l) / 2;
mergeSort(arr, l, m);
mergeSort(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[] = { 82, 61, 33, 45, 16, 57 };
System.out.println("Given array is");
printArray(arr);
MergeSort ob = new MergeSort();
ob.mergeSort(arr, 0, arr.length - 1);
System.out.println("\nSorted array is");
printArray(arr);
}
}