Skip to content

Merge sort recursive added #2446

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

Merged
siriak merged 2 commits into from
Oct 9, 2021
+72 −0
Merged

Merge sort recursive added #2446

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3fd48e9
merge sort recursive added
asinduvg Oct 3, 2021
58c4f56
Merge branch 'master' into master
siriak Oct 9, 2021
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
72 changes: 72 additions & 0 deletions Sorts/MergeSortRecursive.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
import java.util.Arrays;
import java.util.ArrayList;
import java.util.List;

public class MergeSortRecursive {

List<Integer> arr;

public MergeSortRecursive(List<Integer> arr) {
this.arr = arr;
}

public void mergeSort() {
List<Integer> arrSorted = merge(arr);
System.out.println(arrSorted);
}

private static List<Integer> merge(List<Integer> arr) {

// base condition
if (arr.size() <= 1) {
return arr;
}

int arrLength = arr.size();
int half = arrLength / 2;
List<Integer> arrA = arr.subList(0, half);
List<Integer> arrB = arr.subList(half, arr.size());

// recursion
arrA = merge(arrA);
arrB = merge(arrB);

return sort(arrA, arrB);
}

private static List<Integer> sort(List<Integer> unsortedA, List<Integer> unsortedB) {
if (unsortedA.size() <= 0 && unsortedB.size() <= 0) {
return new ArrayList<>();
}
if (unsortedA.size() <= 0) {
return unsortedB;
}
if (unsortedB.size() <= 0) {
return unsortedA;
}
if (unsortedA.get(0) <= unsortedB.get(0)) {
List<Integer> newAl = new ArrayList<Integer>() {
{
add(unsortedA.get(0));
}
};
newAl.addAll(sort(unsortedA.subList(1, unsortedA.size()), unsortedB));
return newAl;
} else {
List<Integer> newAl = new ArrayList<Integer>() {
{
add(unsortedB.get(0));
}
};newAl.addAll(sort(unsortedA, unsortedB.subList(1, unsortedB.size())));
return newAl;
}
}

}

class App {
public static void main(String[] args) {
MergeSortRecursive sort = new MergeSortRecursive(new ArrayList<>(Arrays.asList(4, 3, 1, 8, 5, 10, 0, 1, 4, 11, 8, 9)));
sort.mergeSort();
}
}