HF RL Explorer

Task: Implement and Benchmark Mergesort vs Quicksort in Haskell

Task: Implement and Benchmark Mergesort vs Quicksort in Haskell: a task in Terminal-Lego-15k (Harbor dataset). In Haskell, Data.List.sort uses mergesort rather than quicksort. The key reasons include: - Quicksort's in-place advantages are lost with immutable linked lists - Mergesort naturally fits…

The task

In Haskell, `Data.List.sort` uses mergesort rather than quicksort. The key reasons include: - Quicksort's in-place advantages are lost with immutable linked lists - Mergesort naturally fits the linked-list structure (splitting and merging) - Mergesort guarantees O(n log n) worst-case performance on lists

Part of PrimeIntellect/Terminal-Lego-15k.