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
Questions
- Why estimate runtime complexity over, for example, number of statements?
- How does runtime complexity relate to math functions?
- Is the complexity class that is typically provided the best or worst case?
- Why are loops important in estimating complexity?
- Is O(n log(n)) a better or worse runtime complexity than O(log(n))?
- What are some commonly known complexity classes?