-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSorting.java
61 lines (51 loc) · 1.64 KB
/
Sorting.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
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
// write testcode here
int[] values = {8, 3, 7, 9, 1, 2, 4};
sort(values);
}
public static int smallest(int[] array) {
int smallest = array[0];
for (int i = 1; i < array.length; i++) {
if (smallest > array[i]) {
smallest = array[i];
}
}
return smallest;
}
public static int indexOfTheSmallest(int[] array) {
int smallestIndex = 0;
int smallest = array[0];
for (int i = 0; i < array.length; i++) {
if (smallest > array[i]) {
smallest = array[i];
smallestIndex = i;
}
}
return smallestIndex;
}
public static int indexOfTheSmallestStartingFrom(int[] array, int index) {
int smallestIndex = index;
int smallest = array[index];
for (int i = smallestIndex; i < array.length; i++) {
if (smallest > array[i]) {
smallest = array[i];
smallestIndex = i;
}
}
return smallestIndex;
}
public static void swap(int[] array, int index1, int index2) {
int valueOfOne = array[index1];
int valueOfTwo = array[index2];
array[index1] = valueOfTwo;
array[index2] = valueOfOne;
}
public static void sort(int[] array) {
for (int i = 0; i < array.length; i++) {
swap(array, indexOfTheSmallestStartingFrom(array, i), i);
System.out.println(Arrays.toString(array));
}
}
}