O'Reilly logo

Design and Analysis of Algorithms by Himanshu B. Dave, Parag H. Dave

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

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

15.1 Examples from the Sorting World

15.1.1 Bucket Sort

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required