-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathMain.java
75 lines (60 loc) · 2.1 KB
/
Main.java
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
import java.util.Random;
public class Main {
public static void shiftDown(Integer[] arr, int len, int idx) {
while (idx * 2 + 1 < len) {
int child = idx * 2 + 1;
if (child + 1 < len && arr[child] < arr[child + 1]) ++child;
if (arr[idx] >= arr[child]) break;
swap(arr, idx, child);
idx = child;
}
}
public static void heapSort(Integer[] arr) {
for (int i = arr.length / 2 - 1; i >= 0; --i) {
shiftDown(arr, arr.length, i);
}
for (int i = arr.length - 1; i > 0; --i) {
swap(arr, 0, i);
shiftDown(arr, i, 0);
}
}
public static void swap(Integer[] arr, int i, int j) {
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
public static void main(String[] args) {
int num = 20;
int rangeLeft = 1;
int rangeRight = 10000;
Integer[] arr = generateRandomIntegerArray(num, rangeLeft, rangeRight);
System.out.println("Original array: ");
printArray(arr);
heapSort(arr);
System.out.println("Sorted array: ");
printArray(arr);
}
/**
* @param num the number of array elements
* @param rangeLeft the left side of the range
* @param rangeRight the right side of the range
* @return an array containing N array element sizes between rangeLeft and rangeRight
*/
public static Integer[] generateRandomIntegerArray(int num, int rangeLeft, int rangeRight) {
if (rangeLeft > rangeRight)
throw new RuntimeException("Range is incorrect, rangeLeft must be greater than rangeRight");
Integer[] arr = new Integer[num];
Integer range = rangeRight - rangeLeft;
Random random = new Random();
for (int i = 0; i < num; i++) {
arr[i] = random.nextInt(range) + rangeLeft;
}
return arr;
}
public static <T> void printArray(T arr[]) {
for (T t : arr) {
System.out.print(t + " ");
}
System.out.println();
}
}