-
Notifications
You must be signed in to change notification settings - Fork 85
/
Copy pathMain.java
43 lines (36 loc) · 1.13 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
package ru.arhiser.minimal;
public class Main {
public static void main(String[] args) {
int [] array = new int[] {64, 42, 73, 41, 32, 53, 16, 24, 57, 42, 74, 55, 36};
for (int step = 0; step < array.length; step++) {
System.out.println(arrayToString(array));
int index = min(array, step);
int tmp = array[step];
array[step] = array[index];
array[index] = tmp;
}
}
private static int min(int[] array, int start) {
int minIndex = start;
int minValue = array[start];
for (int i = start + 1; i < array.length; i++) {
if (array[i] < minValue) {
minValue = array[i];
minIndex = i;
}
}
return minIndex;
}
private static String arrayToString(int[] array) {
StringBuilder sb = new StringBuilder();
sb.append("[");
for (int i = 0; i < array.length; i++) {
if (i > 0) {
sb.append(", ");
}
sb.append(array[i]);
}
sb.append("]");
return sb.toString();
}
}