-
Notifications
You must be signed in to change notification settings - Fork 0
/
SelectionSort.java
39 lines (35 loc) · 1.22 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
import java.util.Scanner;
public class SelectionSort {
public static void main(String[] args) {
int aux, smallestPosition, arraySize;
int[] numbers;
Scanner input = new Scanner(System.in);
System.out.println("Insert the Array Size:");
arraySize = Integer.parseInt(
input.nextLine()
);
numbers = new int[arraySize];
System.out.println("Insert the desordered values:");
for(int i = 0; i < numbers.length; i++){
numbers[i] = Integer.parseInt(
input.nextLine()
);
}
for(int i = 0; i < numbers.length - 1; i++){
smallestPosition = i;
for(int j = i + 1; j < numbers.length; j ++){
if(numbers[j] < numbers[smallestPosition]){
smallestPosition = j;
}
}
aux = numbers[i];
numbers[i] = numbers[smallestPosition];
numbers[smallestPosition] = aux;
}
System.out.println("Ok, so the ordered (by Selection Sort) values are:");
for(int i = 0; i < numbers.length; i++){
System.out.println(numbers[i]);
}
input.close();
}
}