Skip to content

Commit 8ddfe3f

Browse files
author
João Pedro
committed
Add Gnome Sort em java e modificado README para referenciação do mesmo
1 parent 2ee49dd commit 8ddfe3f

File tree

2 files changed

+29
-2
lines changed

2 files changed

+29
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2807,8 +2807,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
28072807
</a>
28082808
</td>
28092809
<td> <!-- Java -->
2810-
<a href="./CONTRIBUTING.md">
2811-
<img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
2810+
<a href="./src/java/GnomeSort.java">
2811+
<img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/java/java-original.svg" />
28122812
</a>
28132813
</td>
28142814
<td> <!-- Python -->

src/java/GnomeSort.java

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
import java.util.Arrays;
2+
3+
public class GnomeSort {
4+
public static void main(String[] args) {
5+
int vetor[] = {10,-10,-9,9,8,-8,7,-7,6,-6,5,-5,4,-4,3,-3,2,-2,1,-1,0};
6+
System.out.println("Vetor antes da ordenação:" + Arrays.toString(vetor));
7+
8+
gnomeSort(vetor);
9+
System.out.println("Vetor após ordenação com o algoritmo Gnome Sort: " + Arrays.toString(vetor));
10+
}
11+
12+
static void gnomeSort(int[] vetor) {
13+
int i=0;
14+
while (i < vetor.length) {
15+
if (i == 0 || vetor[i] >= vetor[i-1]) {
16+
i++;
17+
18+
} else {
19+
int auxiliar = vetor[i];
20+
vetor[i] = vetor[i-1];
21+
vetor[i-1] = auxiliar;
22+
23+
i--;
24+
}
25+
}
26+
}
27+
}

0 commit comments

Comments
 (0)