forked from kelvins/algorithms-and-data-structures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSelectionSort.java
44 lines (30 loc) · 904 Bytes
/
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
public class SelectionSort {
public static void main(String [] args){
int vetor[] = {9, 0, 4, 2, 3, 8, 7, 1, 6, 5};
System.out.println("Selection Sort:");
System.out.println("Vetor não ordenado:");
mostraVetor(vetor);
vetor = selectionSort(vetor, 0);
System.out.println("Vetor ordenado:");
mostraVetor(vetor);
}
public static int[] selectionSort(int vetor[], int indice){
if(indice >= vetor.length-1)
return vetor;
int minIndice = indice;
for (int i = indice+1; i < vetor.length; i++)
if(vetor[i] < vetor[minIndice])
minIndice = i;
int temp = vetor[indice];
vetor[indice] = vetor[minIndice];
vetor[minIndice] = temp;
selectionSort(vetor, indice+1);
return vetor;
}
public static void mostraVetor(int vetor[]){
for (int i = 0; i < vetor.length; i++){
System.out.print(vetor[i] + ", ");
}
System.out.println("");
}
}