January 2019
Intermediate to advanced
316 pages
8h 8m
English
Content preview from Hands-On Data Structures and Algorithms with Rust
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
O(n log(n))
This is sometimes called quasilinear time and is the best achievable complexity for sorting: