-
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSelectionSortMIN.java
More file actions
30 lines (30 loc) · 950 Bytes
/
Copy pathSelectionSortMIN.java
File metadata and controls
30 lines (30 loc) · 950 Bytes
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
package Sorting;
import java.util.Arrays;
public class SelectionSortMIN {
public static void main(String[] args) {
int[] array = {12, -5, 0, 23, -17, 8, -1, 34, -9, 2, 19, -12, 7, -3, 25, -20, 4, -7, 15, -2};
System.out.println(Arrays.toString(sort(array)));
}
static void swap(int[] arr , int first , int second){
int temp = arr[first];
arr[first] = arr[second];
arr[second] = temp;
}
static int getMinIndex(int[] arr , int start , int last){
int min = start;
for (int i = start; i <= last ; i++) {
if(arr[i]<arr[min])
min = i;
}
return min;
}
static int[] sort(int[] arr){
for(int i = 0 ; i<arr.length;i++){
int start = i ;
int end = arr.length-1;
int minIndex = getMinIndex(arr , start , end );
swap(arr , minIndex , start);
}
return arr;
}
}