Analyze the complexities of several well-known functions

• O(1)

  • push and pop on stacks
  • remove and add on queues

• O(n)

  • linear search
  • add a new element into the end of a linked list

• O(log n)

  • binary search
  • convert a decimal number into binary

Previous slide

Next slide

Back to first slide

View graphic version