algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-22 03:24:57 +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

12
Sorts/CycleSort.java
View File

@ -4,11 +4,10 @@ import static Sorts.SortUtils.less;
import static Sorts.SortUtils.print;
/**
* @author Podshivalov Nikita (https://github.com/nikitap492)
* @author Podshivalov Nikita (https://github.com/nikitap492)
*/
class CycleSort implements SortAlgorithm {
@Override
public <T extends Comparable<T>> T[] sort(T[] arr) {
int n = arr.length;
@ -24,7 +23,7 @@ class CycleSort implements SortAlgorithm {
if (less(arr[i], item)) pos++;
// If item is already in correct position
if (pos == j) continue;
if (pos == j) continue;
// ignore all duplicate elements
while (item.compareTo(arr[pos]) == 0)
@ -41,7 +40,7 @@ class CycleSort implements SortAlgorithm {
// Find position where we put the element
for (int i = j + 1; i < n; i++)
if (less(arr[i], item)){
if (less(arr[i], item)) {
pos += 1;
}
@ -60,7 +59,7 @@ class CycleSort implements SortAlgorithm {
return arr;
}
private <T extends Comparable<T>> T replace(T[] arr, int pos, T item){
private <T extends Comparable<T>> T replace(T[] arr, int pos, T item) {
T temp = item;
item = arr[pos];
arr[pos] = temp;
@ -68,9 +67,8 @@ class CycleSort implements SortAlgorithm {
}
public static void main(String[] args) {
Integer arr[] = { 4, 23, 6, 78, 1, 26, 11, 23 , 0, -6, 3, 54, 231, 9, 12 };
Integer arr[] = {4, 23, 6, 78, 1, 26, 11, 23, 0, -6, 3, 54, 231, 9, 12};
CycleSort cycleSort = new CycleSort();
cycleSort.sort(arr);