Mirror/powersort
1
0
Fork 0
mirror of https://gitlab.uni-marburg.de/langbeid/powersort.git synced 2025-01-22 19:55:44 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

benchmark: exclude merge sort

Browse Source
This commit is contained in:
Daniel Langbein 2024-12-17 16:38:41 +00:00
parent b730c34ddd
commit a7a6f9e246
Signed by: langfingaz
GPG Key ID: 6C47C753F0823002
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
app/src/main/java/de/uni_marburg/powersort/sort/SortEnum.java
View File

@ -5,7 +5,7 @@ import de.uni_marburg.powersort.benchmark.NaturalOrder;
public enum SortEnum { public enum SortEnum {
// BUBBLE_SORT, // BUBBLE_SORT,
MERGE_SORT, // MERGE_SORT,
TIM_SORT, TIM_SORT,
FINN_SORT, FINN_SORT,
ASORT; ASORT;
@ -13,7 +13,7 @@ public enum SortEnum {
public SortImpl getSortImpl() { public SortImpl getSortImpl() {
return switch (this) { return switch (this) {
// case BUBBLE_SORT -> array -> BubbleSort.sort(array, NaturalOrder.INSTANCE); // case BUBBLE_SORT -> array -> BubbleSort.sort(array, NaturalOrder.INSTANCE);
case MERGE_SORT -> array -> MergeSort.legacyMergeSort(array, NaturalOrder.INSTANCE); // case MERGE_SORT -> array -> MergeSort.legacyMergeSort(array, NaturalOrder.INSTANCE);
case TIM_SORT -> array -> TimSort.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0); case TIM_SORT -> array -> TimSort.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0);
case FINN_SORT -> array -> FinnSort.sort(array, NaturalOrder.INSTANCE); case FINN_SORT -> array -> FinnSort.sort(array, NaturalOrder.INSTANCE);
case ASORT -> array -> ASort.sort(array, NaturalOrder.INSTANCE); case ASORT -> array -> ASort.sort(array, NaturalOrder.INSTANCE);