Daniel Dantas

15%
Flag icon
It’s been proven that if we want to fully sort n items via a series of head-to-head comparisons, there’s just no way to compare them any fewer than O(n log n) times.
Algorithms to Live By: The Computer Science of Human Decisions
Rate this book
Clear rating
Open Preview