mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-08 02:04:31 +08:00
refactor: cleanup StoogeSort
(#5283)
* refactor: cleanup StoogeSort * refactor: update DIRECTORY.md for StoogeSortTest --------- Co-authored-by: Alex Klymenko <alx@alx.com>
This commit is contained in:
@ -7,9 +7,12 @@ package com.thealgorithms.sorts;
|
||||
public class StoogeSort implements SortAlgorithm {
|
||||
|
||||
@Override
|
||||
public <T extends Comparable<T>> T[] sort(T[] unsortedArray) {
|
||||
sort(unsortedArray, 0, unsortedArray.length);
|
||||
return unsortedArray;
|
||||
public <T extends Comparable<T>> T[] sort(T[] array) {
|
||||
if (array.length == 0) {
|
||||
return array;
|
||||
}
|
||||
sort(array, 0, array.length);
|
||||
return array;
|
||||
}
|
||||
|
||||
public <T extends Comparable<T>> T[] sort(T[] unsortedArray, int start, int end) {
|
||||
@ -28,24 +31,4 @@ public class StoogeSort implements SortAlgorithm {
|
||||
}
|
||||
return unsortedArray;
|
||||
}
|
||||
|
||||
public static void main(String[] args) {
|
||||
StoogeSort stoogeSort = new StoogeSort();
|
||||
|
||||
Integer[] integerArray = {8, 84, 53, 953, 64, 2, 202};
|
||||
// Print integerArray unsorted
|
||||
SortUtils.print(integerArray);
|
||||
|
||||
stoogeSort.sort(integerArray);
|
||||
// Print integerArray sorted
|
||||
SortUtils.print(integerArray);
|
||||
|
||||
String[] stringArray = {"g", "d", "a", "b", "f", "c", "e"};
|
||||
// Print stringArray unsorted
|
||||
SortUtils.print(stringArray);
|
||||
|
||||
stoogeSort.sort(stringArray);
|
||||
// Print stringArray sorted
|
||||
SortUtils.print(stringArray);
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user