-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSelectionSort.java
More file actions
44 lines (36 loc) · 1.03 KB
/
SelectionSort.java
File metadata and controls
44 lines (36 loc) · 1.03 KB
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
import java.util.Arrays;
public class SelectionSort {
public static void main(String[] args) {
int [] arr={3,1,5,4,2};
SelectionSort(arr);
System.out.println(Arrays.toString(arr));
}
static void SelectionSort(int[] arr) {
for (int i=0;i<arr.length;i++){
int start=0;
int last=arr.length-i-1;
//find
int Max=getMaxIndex(arr,start,arr.length-1);
swap(arr,Max,last);
}
}
static int getMaxIndex(int[] arr, int start, int l) {
int max=start;
for(int i=0;i<arr.length;i++){
if(arr[i]>max){
max=arr[i];
}
}
return max;
}
static void swap(int[]arr,int index1,int index2){
for(int j=1;j<arr.length;j++){
if(arr[j]<arr[j-1]){//swap now
int temp=arr[j-1];
arr[j-1]=arr[j];
arr[j]=temp;
// swap=true;
}
}
}
}