Chapter 15
Examples of Complexty Calculation
Objectives
After reading this chapter, you should understand:
- How to determine the Time Complexity of Sorting Algorithms
- How to determine the Time Complexity of Set Operations and Mappings
- The Binary Search Principle
- Application of Bit Vectors: Analysis of Hashing, The Trie Principle
- Amortized Analysis: Principles and Applications
- Potential Functions
- How choice of Data Structure affects Complexity
- The Binomial, Binary and Fibonacci Heaps: Working, Applications and Implications for efficiency
- Time Complexity of Dijkstra’s Algorithm: Influence of Data Structure
- Splay Trees: Principles, Organization, Analysis and Applications
Chapter Outline
Get Design and Analysis of Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
