Tag: Algorithm Complexity
-
Sorting Algorithm Speed: 100 to 10K Elements Benchmark
At 1000 elements, Python's sorted() beats hand-written quicksort by 47x. Real benchmark data for interview-size arrays with the numbers behind why.
-
Merge Sort vs Quick Sort: Cache & Pivot Benchmark Results
Compare merge sort vs quick sort performance with real benchmark data. Cache efficiency and pivot strategies reveal surprising winners.