Skip to content

fix: handle empty inputs in CircleSort #5121

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

Merged
vil02 merged 9 commits into from
May 5, 2024
Merged

fix: handle empty inputs in CircleSort #5121

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
b3de373
fix: handle empty inputs in `CircleSort`
vil02 Apr 26, 2024
bab5d8f
style: remove `main` method
vil02 Apr 26, 2024
2f2d9aa
Merge branch 'master' into add_test_for_CircleSort
vil02 Apr 27, 2024
5263ac1
Merge branch 'master' into add_test_for_CircleSort
vil02 May 1, 2024
d4891f3
Merge branch 'master' into add_test_for_CircleSort
vil02 May 2, 2024
b0eb4e7
Merge branch 'master' into add_test_for_CircleSort
vil02 May 2, 2024
0ff0b85
Merge branch 'master' into add_test_for_CircleSort
vil02 May 3, 2024
5a48aa4
Merge branch 'master' into add_test_for_CircleSort
vil02 May 4, 2024
9a7a5e5
Merge branch 'master' into add_test_for_CircleSort
vil02 May 4, 2024
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
20 changes: 3 additions & 17 deletions src/main/java/com/thealgorithms/sorts/CircleSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,6 +10,9 @@ public class CircleSort implements SortAlgorithm {
@Override
public <T extends Comparable<T>> T[] sort(T[] array) {
int n = array.length;
if (n == 0) {
return array;
}
while (doSort(array, 0, n - 1)) {
}
return array;
Expand Down Expand Up @@ -50,21 +53,4 @@ private <T extends Comparable<T>> Boolean doSort(T[] array, int left, int right)

return swapped || leftHalf || rightHalf;
}

/* Driver code*/
public static void main(String[] args) {
CircleSort CSort = new CircleSort();

Integer[] arr = {4, 23, 6, 78, 1, 54, 231, 9, 12};
CSort.sort(arr);
for (int i = 0; i < arr.length - 1; ++i) {
assert arr[i] <= arr[i + 1];
}

String[] stringArray = {"c", "a", "e", "b", "d"};
CSort.sort(stringArray);
for (int i = 0; i < stringArray.length - 1; ++i) {
assert arr[i].compareTo(arr[i + 1]) <= 0;
}
}
}
8 changes: 8 additions & 0 deletions src/test/java/com/thealgorithms/sorts/CircleSortTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
package com.thealgorithms.sorts;

class CircleSortTest extends SortingAlgorithmTest {
@Override
SortAlgorithm getSortAlgorithm() {
return new CircleSort();
}
}