algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 14:34:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: update the whole repository

Browse Source 
* fix some bugs
* delete duplicate files
* format code
This commit is contained in:
yanglbme
2019-05-09 19:32:54 +08:00
parent 163db8521a
commit 29948363da
368 changed files with 4372 additions and 30841 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
Sorts/GnomeSort.java
View File

@ -7,19 +7,20 @@ import static Sorts.SortUtils.*;
*
* @author Podshivalov Nikita (https://github.com/nikitap492)
* @since 2018-04-10
*
**/
public class GnomeSort implements SortAlgorithm{
public class GnomeSort implements SortAlgorithm {
@Override
public <T extends Comparable<T>> T[] sort(T[] arr) {
int i = 1;
int j = 2;
while (i < arr.length){
if ( less(arr[i - 1], arr[i]) ) i = j++;
while (i < arr.length) {
if (less(arr[i - 1], arr[i])) i = j++;
else {
swap(arr, i - 1, i);
if (--i == 0){ i = j++; }
if (--i == 0) {
i = j++;
}
}
}
@ -27,8 +28,8 @@ public class GnomeSort implements SortAlgorithm{
}
public static void main(String[] args) {
Integer[] integers = { 4, 23, 6, 78, 1, 26, 11, 23 , 0, -6, 3, 54, 231, 9, 12 };
String[] strings = {"c", "a", "e", "b","d", "dd","da","zz", "AA", "aa","aB","Hb", "Z"};
Integer[] integers = {4, 23, 6, 78, 1, 26, 11, 23, 0, -6, 3, 54, 231, 9, 12};
String[] strings = {"c", "a", "e", "b", "d", "dd", "da", "zz", "AA", "aa", "aB", "Hb", "Z"};
GnomeSort gnomeSort = new GnomeSort();
gnomeSort.sort(integers);