Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Adding odd even sort algorithm #123

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Adding odd even sort algorithm #123

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 29 additions & 0 deletions Java/Odd_Even_Sort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
public class OddEvenSort {
public static <T extends Comparable<T>> void sort(T[] array) {
boolean sorted = false;
while (!sorted) {
sorted = innerSort(array, 1);
sorted = innerSort(array, 0) && sorted;
}
}

private static <T extends Comparable<T>> boolean innerSort(T[] array, Integer i) {
boolean sorted = true;
for (; i < array.length - 1; i += 2)
{
if (array[i].compareTo(array[i + 1]) > 0)
{
swap(array, i, i + 1);
sorted = false;
}
}
return sorted;
}

private static <T extends Comparable<T>> void swap(
T[] array, int a, int b) {
T temp = array[a];
array[a] = array[b];
array[b] = temp;
}
}