-
Notifications
You must be signed in to change notification settings - Fork 0
/
SelectionSort.java
46 lines (36 loc) · 1.1 KB
/
SelectionSort.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
// Selection sort
public class SelectionSort {
public static int[] SelectionSort(int[] arrayInput) {
int[] inputArray = arrayInput;
int tempValue = arrayInput[0];
int tempIndex = 0;
// Traverse the array by comparing one element with the rest
for(int i =0; i <inputArray.length; i++) {
for( int j =i+1; j<inputArray.length; j++) {
if(arrayInput[i] > arrayInput[j]) {
tempIndex = j;
}
}
// Swap the elements if the low index elements are largers than high index elements
if(tempIndex > i) {
inputArray = swap(i, tempIndex, inputArray);
}
}
return inputArray;
}
// Swapping two elements
private static int[] swap(int i, int tempIndex, int[] inputArray) {
int tempValue = inputArray[i];
inputArray[i] = inputArray[tempIndex];
inputArray[tempIndex] = tempValue;
return inputArray;
}
public static void main(String[] args) {
int[] inputOne = { 10,9,8,7,6,5,4,3,2,1};
int[] inputTwo = {1,2,3,4,5,6,7,8,9,10};
inputOne = SelectionSort(inputOne);
for (int i = 0; i < inputOne.length; i++) {
System.out.println(inputOne[i]);
}
}
}