benchmark: include merge and bubble again ^^

This commit is contained in:
Daniel Langbein 2024-12-17 16:52:59 +00:00
parent 385082bb8d
commit 526d69e95b
Signed by: langfingaz
GPG Key ID: 6C47C753F0823002
3 changed files with 13 additions and 6 deletions

View File

@ -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);

View File

@ -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);

View File

@ -0,0 +1,7 @@
package de.uni_marburg.powersort.sort;
public class BubbleSortTest extends AbstractSortTest {
BubbleSortTest() {
sortAlg = SortEnum.BUBBLE_SORT;
}
}