-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sortings.java
51 lines (47 loc) · 1.36 KB
/
Sortings.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
public class Sortings {
public static void printArray(int arr[]) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
}
public static void main(String[] args) {
// Bubble sort
int arr[] = { 7, 8, 3, 1, 2 };
// for(int i=0; i<arr.length-1; i++){
// for(int j=0; j<arr.length-i-1; j++){
// if (arr[j] > arr[j+1]) {
// //swap
// int temp = arr[j];
// arr[j] = arr[j+1];
// arr[j+1] = temp;
// }
// }
// }
// Selection sort
// for (int i = 0; i < arr.length - 1; i++) {
// int smallest = i;
// for (int j = i + 1; j < arr.length; j++) {
// if (arr[j] < arr[smallest]) {
// smallest = j;
// }
// }
// // swap
// int temp = arr[smallest];
// arr[smallest] = arr[i];
// arr[i] = temp;
// }
// Insertion sort
for (int i = 0; i < arr.length; i++) {
int current = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > current) {
// keep swapping
arr[j + 1] = arr[j];
j--;
}
arr[j+1] = current;
}
printArray(arr);
}
}