HF RL Explorer

Task: Implement Bottom-Up and Top-Down Merge Sort for Linked Lists

Task: Implement Bottom-Up and Top-Down Merge Sort for Linked Lists: a task in Terminal-Lego-15k (Harbor dataset). The std::list< ::sort() in C++ standard libraries has historically used a bottom-up merge sort approach (often called "onion chaining"). However, Visual Studio 2022 switched to a…

The task

The `std::list<>::sort()` in C++ standard libraries has historically used a bottom-up merge sort approach (often called "onion chaining"). However, Visual Studio 2022 switched to a top-down recursive implementation that divides by size rather than scanning to split lists.

Part of PrimeIntellect/Terminal-Lego-15k.