Repository navigation
Expand file tree
/
Copy path32-MergeSort.java
More file actions
53 lines (49 loc) · 1.69 KB
/
Copy path32-MergeSort.java
File metadata and controls
53 lines (49 loc) · 1.69 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
import java.util.Arrays;
import java.util.Scanner;
class MergeSort {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] numbers = readArray(scanner);
mergeSort(numbers, 0, numbers.length - 1);
System.out.println("Sorted array: " + Arrays.toString(numbers));
scanner.close();
}
private static void mergeSort(int[] numbers, int left, int right) {
if (left >= right) {
return;
}
int middle = left + (right - left) / 2;
mergeSort(numbers, left, middle);
mergeSort(numbers, middle + 1, right);
merge(numbers, left, middle, right);
}
private static void merge(int[] numbers, int left, int middle, int right) {
int[] leftArray = Arrays.copyOfRange(numbers, left, middle + 1);
int[] rightArray = Arrays.copyOfRange(numbers, middle + 1, right + 1);
int i = 0;
int j = 0;
int k = left;
while (i < leftArray.length && j < rightArray.length) {
if (leftArray[i] <= rightArray[j]) {
numbers[k++] = leftArray[i++];
} else {
numbers[k++] = rightArray[j++];
}
}
while (i < leftArray.length) {
numbers[k++] = leftArray[i++];
}
while (j < rightArray.length) {
numbers[k++] = rightArray[j++];
}
}
private static int[] readArray(Scanner scanner) {
System.out.print("Enter array size: ");
int size = scanner.nextInt();
int[] numbers = new int[size];
for (int i = 0; i < size; i++) {
numbers[i] = scanner.nextInt();
}
return numbers;
}
}