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

benchmark: include merge and bubble again ^^

Browse Source
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
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
app/src/main/java/de/uni_marburg/powersort/data/DataEnum.java
View File

@ -14,8 +14,8 @@ public enum DataEnum {
int longListSize = 300_000_000; // Any larger: Out of Heap Space. TODO GRADLE config int longListSize = 300_000_000; // Any larger: Out of Heap Space. TODO GRADLE config
int middleListSize = 250_000_000; int middleListSize = 250_000_000;
int runs = 1000; int runs = 1_000;
int runLength = 1000; int runLength = 1_000;
return switch (this) { return switch (this) {
case RANDOM_INTEGERS_300M -> new RandomIntegers(longListSize, seed); case RANDOM_INTEGERS_300M -> new RandomIntegers(longListSize, seed);

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

@ -4,16 +4,16 @@ import de.uni_marburg.powersort.FinnSort.FinnSort;
import de.uni_marburg.powersort.benchmark.NaturalOrder; 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;
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);

7
app/src/test/java/de/uni_marburg/powersort/sort/BubbleSortTest.java Normal file
View File

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