mirror of
https://gitlab.uni-marburg.de/langbeid/powersort.git
synced 2025-01-21 19:50:35 +01:00
benchmark: include merge and bubble again ^^
This commit is contained in:
parent
385082bb8d
commit
526d69e95b
@ -14,8 +14,8 @@ public enum DataEnum {
|
||||
|
||||
int longListSize = 300_000_000; // Any larger: Out of Heap Space. TODO GRADLE config
|
||||
int middleListSize = 250_000_000;
|
||||
int runs = 1000;
|
||||
int runLength = 1000;
|
||||
int runs = 1_000;
|
||||
int runLength = 1_000;
|
||||
|
||||
return switch (this) {
|
||||
case RANDOM_INTEGERS_300M -> new RandomIntegers(longListSize, seed);
|
||||
|
@ -4,16 +4,16 @@ import de.uni_marburg.powersort.FinnSort.FinnSort;
|
||||
import de.uni_marburg.powersort.benchmark.NaturalOrder;
|
||||
|
||||
public enum SortEnum {
|
||||
// BUBBLE_SORT,
|
||||
// MERGE_SORT,
|
||||
BUBBLE_SORT,
|
||||
MERGE_SORT,
|
||||
TIM_SORT,
|
||||
FINN_SORT,
|
||||
ASORT;
|
||||
|
||||
public SortImpl getSortImpl() {
|
||||
return switch (this) {
|
||||
// case BUBBLE_SORT -> array -> BubbleSort.sort(array, NaturalOrder.INSTANCE);
|
||||
// case MERGE_SORT -> array -> MergeSort.legacyMergeSort(array, NaturalOrder.INSTANCE);
|
||||
case BUBBLE_SORT -> array -> BubbleSort.sort(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 FINN_SORT -> array -> FinnSort.sort(array, NaturalOrder.INSTANCE);
|
||||
case ASORT -> array -> ASort.sort(array, NaturalOrder.INSTANCE);
|
||||
|
@ -0,0 +1,7 @@
|
||||
package de.uni_marburg.powersort.sort;
|
||||
|
||||
public class BubbleSortTest extends AbstractSortTest {
|
||||
BubbleSortTest() {
|
||||
sortAlg = SortEnum.BUBBLE_SORT;
|
||||
}
|
||||
}
|
Loading…
x
Reference in New Issue
Block a user