-
Notifications
You must be signed in to change notification settings - Fork 171
/
Copy pathCycleSort.java
55 lines (44 loc) · 1.39 KB
/
CycleSort.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
// CycleSort.java
public class CycleSort {
public static void cycleSort(int[] array) {
int n = array.length;
for (int cycleStart = 0; cycleStart < n - 1; cycleStart++) {
int item = array[cycleStart];
int pos = cycleStart;
for (int i = cycleStart + 1; i < n; i++) {
if (array[i] < item) {
pos++;
}
}
if (pos == cycleStart) continue;
while (item == array[pos]) {
pos++;
}
int temp = array[pos];
array[pos] = item;
item = temp;
while (pos != cycleStart) {
pos = cycleStart;
for (int i = cycleStart + 1; i < n; i++) {
if (array[i] < item) {
pos++;
}
}
while (item == array[pos]) {
pos++;
}
temp = array[pos];
array[pos] = item;
item = temp;
}
}
}
public static void main(String[] args) {
int[] array = {1, 8, 3, 9, 10, 10, 2, 4};
cycleSort(array);
System.out.print("Sorted array: ");
for (int num : array) {
System.out.print(num + " ");
}
}
}