Repository navigation
Expand file tree
/
Copy pathSortAlgorithm.java
More file actions
160 lines (145 loc) · 3.28 KB
/
Copy pathSortAlgorithm.java
File metadata and controls
160 lines (145 loc) · 3.28 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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
package test;
public class SortAlgorithm {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr = {3,9,4,7,5,0,1,6,8,2};
// select(arr);
// quick(arr, 0, arr.length-1);
// print(arr);
int[] temp = new int[arr.length];
print(arr);
mergeSort(arr, temp, 0, arr.length-1);
print(arr);
}
static void print(int[] arr) {
for(int a : arr) {
System.out.print(a + ", ");
}
System.out.println();
}
static void bubble(int[] arr) {
for(int i = 0; i < arr.length; i++) {
for(int j = 0; j < arr.length - 1 - i; j++) {
if(arr[j] > arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
print(arr);
}
static void insert(int[] arr) {
for(int i = 1; i < arr.length; i++) {
int key = arr[i];
int j = i-1;
while(arr[j] >= key) {
arr[j+1] = arr[j];
j--;
if(j < 0) break;
}
arr[j+1] = key;
}
print(arr);
}
static void select(int[] arr) {
for(int i = 0; i < arr.length; i++) {
int min = arr[i];
int index = i;
for(int j = i; j < arr.length-1; j++) {
if(arr[j+1] < min) {
min = arr[j+1];
index = j+1;
}
}
int temp = arr[index];
arr[index] = arr[i];
arr[i] = temp;
}
print(arr);
}
static void quick(int[] arr, int start, int end) {
System.out.println("quick " + start + " " + end);
int part = partition(arr, start, end);
if(part - 1 > start) quick(arr, start, part-1);
if(end > part) quick(arr, part, end);
}
static int partition(int[] arr, int start, int end) {
int pivot = arr[(start+end) / 2];
while(start <= end) {
while(arr[start] < pivot) start++;
while(arr[end] > pivot) end--;
if(start <= end) {
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}
return start;
}
// static void mergeSort(int[] arr, int[] temp, int start, int end) {
// if(start < end) {
// int mid = (start + end) / 2;
// mergeSort(arr, temp, start, mid);
// mergeSort(arr, temp, mid+1, end);
// merge(arr, temp, start, mid, end);
// }
// }
//
// static void merge(int[] arr, int[] temp, int start, int mid, int end) {
// for(int i = start; i <= end; i++) {
// temp[i] = arr[i];
// }
// int part1 = start;
// int part2 = mid+1;
// int index = start;
// while(part1 <= mid && part2 <= end) {
// if(temp[part1] < temp[part2]) {
// arr[index] = temp[part1];
// part1++;
// }
// else {
// arr[index] = temp[part2];
// part2++;
// }
// index++;
// }
// for(int i = part1; i <= mid; i++) {
// arr[index] = temp[i];
// index++;
// }
// }
static void mergeSort(int[] arr, int[] temp, int start, int end) {
if(start < end) {
int mid = (start + end) / 2;
mergeSort(arr, temp, start, mid);
mergeSort(arr, temp, mid+1, end);
merge(arr, temp, start, mid, end);
}
}
static void merge(int[] arr, int[] temp, int start, int mid, int end) {
for(int i = start; i <= end; i++) {
temp[i] = arr[i];
}
int part1 = start;
int part2 = mid+1;
int index = start;
while(part1 <= mid && part2 <= end) {
if(temp[part1] < temp[part2]) {
arr[index] = temp[part1];
part1++;
}
else {
arr[index] = temp[part2];
part2++;
}
index++;
}
for(int i = part1; i <= mid; i++) {
arr[index] = temp[i];
index++;
}
}
}