algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2020-10-24 10:23:28 +00:00
parent a23bac99e8
commit 5d59a2e828
219 changed files with 13758 additions and 14582 deletions
Download Patch File Download Diff File Expand all files Collapse all files

144
Sorts/MergeSort.java
View File

@@ -9,90 +9,84 @@ import static Sorts.SortUtils.print;
* @author Podshivalov Nikita (https://github.com/nikitap492)
* @see SortAlgorithm
*/
class MergeSort implements SortAlgorithm {
/**
* This method implements the Generic Merge Sort
*
* @param unsorted the array which should be sorted
* @param <T> Comparable class
* @return sorted array
*/
@Override
public <T extends Comparable<T>> T[] sort(T[] unsorted) {
doSort(unsorted, 0, unsorted.length - 1);
return unsorted;
/**
* This method implements the Generic Merge Sort
*
* @param unsorted the array which should be sorted
* @param <T> Comparable class
* @return sorted array
*/
@Override
public <T extends Comparable<T>> T[] sort(T[] unsorted) {
doSort(unsorted, 0, unsorted.length - 1);
return unsorted;
}
/**
* @param arr The array to be sorted
* @param left The first index of the array
* @param right The last index of the array Recursively sorts the array in increasing order
*/
private static <T extends Comparable<T>> void doSort(T[] arr, int left, int right) {
if (left < right) {
int mid = left + (right - left) / 2;
doSort(arr, left, mid);
doSort(arr, mid + 1, right);
merge(arr, left, mid, right);
}
}
/**
* This method implements the merge step of the merge sort
*
* @param arr The array to be sorted
* @param left The first index of the array
* @param mid The middle index of the array
* @param right The last index of the array merges two parts of an array in increasing order
*/
private static <T extends Comparable<T>> void merge(T[] arr, int left, int mid, int right) {
int length = right - left + 1;
T[] temp = (T[]) new Comparable[length];
int i = left;
int j = mid + 1;
int k = 0;
while (i <= mid && j <= right) {
if (arr[i].compareTo(arr[j]) <= 0) {
temp[k++] = arr[i++];
} else {
temp[k++] = arr[j++];
}
}
/**
* @param arr The array to be sorted
* @param left The first index of the array
* @param right The last index of the array
* Recursively sorts the array in increasing order
**/
private static <T extends Comparable<T>> void doSort(T[] arr, int left, int right) {
if (left < right) {
int mid = left + (right - left) / 2;
doSort(arr, left, mid);
doSort(arr, mid + 1, right);
merge(arr, left, mid, right);
}
while (i <= mid) {
temp[k++] = arr[i++];
}
/**
* This method implements the merge step of the merge sort
*
* @param arr The array to be sorted
* @param left The first index of the array
* @param mid The middle index of the array
* @param right The last index of the array
* merges two parts of an array in increasing order
**/
private static <T extends Comparable<T>> void merge(T[] arr, int left, int mid, int right) {
int length = right - left + 1;
T[] temp = (T[]) new Comparable[length];
int i = left;
int j = mid + 1;
int k = 0;
while (i <= mid && j <= right) {
if (arr[i].compareTo(arr[j]) <= 0) {
temp[k++] = arr[i++];
} else {
temp[k++] = arr[j++];
}
}
while (i <= mid) {
temp[k++] = arr[i++];
}
while (j <= right) {
temp[k++] = arr[j++];
}
System.arraycopy(temp, 0, arr, left, length);
while (j <= right) {
temp[k++] = arr[j++];
}
// Driver program
public static void main(String[] args) {
System.arraycopy(temp, 0, arr, left, length);
}
// Integer Input
Integer[] arr = {4, 23, 6, 78, 1, 54, 231, 9, 12};
MergeSort mergeSort = new MergeSort();
mergeSort.sort(arr);
// Driver program
public static void main(String[] args) {
// Output => 1 4 6 9 12 23 54 78 231
print(arr);
// Integer Input
Integer[] arr = {4, 23, 6, 78, 1, 54, 231, 9, 12};
MergeSort mergeSort = new MergeSort();
mergeSort.sort(arr);
// String Inpu
String[] stringArray = {"c", "a", "e", "b", "d"};
mergeSort.sort(stringArray);
//Output => a b c d e
print(stringArray);
}
// Output => 1 4 6 9 12 23 54 78 231
print(arr);
// String Inpu
String[] stringArray = {"c", "a", "e", "b", "d"};
mergeSort.sort(stringArray);
// Output => a b c d e
print(stringArray);
}
}