Task: Demonstrate Why O(n log n) is Slower Than O(n)

Task: Demonstrate Why O(n log n) is Slower Than O(n): a task in Terminal-Lego-15k (Harbor dataset). A common misconception is that n log(n) should be less than n because "log n is usually less than 1." This task requires you to empirically demonstrate why O(n log n) complexity is considered worse…