From a7a6f9e2461f11aea49bbc1c3938b3dda92c046a Mon Sep 17 00:00:00 2001
From: Daniel Langbein <daniel@systemli.org>
Date: Tue, 17 Dec 2024 16:38:41 +0000
Subject: [PATCH] benchmark: exclude merge sort

---
 app/src/main/java/de/uni_marburg/powersort/sort/SortEnum.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/app/src/main/java/de/uni_marburg/powersort/sort/SortEnum.java b/app/src/main/java/de/uni_marburg/powersort/sort/SortEnum.java
index 976bfd8..8053d53 100644
--- a/app/src/main/java/de/uni_marburg/powersort/sort/SortEnum.java
+++ b/app/src/main/java/de/uni_marburg/powersort/sort/SortEnum.java
@@ -5,7 +5,7 @@ import de.uni_marburg.powersort.benchmark.NaturalOrder;
 
 public enum SortEnum {
 //    BUBBLE_SORT,
-    MERGE_SORT,
+//    MERGE_SORT,
     TIM_SORT,
     FINN_SORT,
     ASORT;
@@ -13,7 +13,7 @@ public enum SortEnum {
     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 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);