Task: Demonstrate O(n log n) vs O(n²) Algorithm Efficiency

Task: Demonstrate O(n log n) vs O(n²) Algorithm Efficiency: a task in Terminal-Lego-15k (Harbor dataset). You need to create a program that demonstrates why O(n log n) algorithms are more efficient than O(n²) algorithms, using concrete numerical examples.