BIG O

Cards (9)

  • Linked List Big O
    O(n)
  • Binary Tree Big O
    O(log n)
  • Time complexity of linear search on average

    O(n)
  • Explain what is meant by best time O(n)
    Linear
    Best time grows at the same rate as the number of elements
  • Explain what worst space O(1) means
    Constant
    Will always take the same amount of memory
  • Best case insertion
    O(n)
  • What does best case O(n) mean?
    As the number of elements increases the number of steps increases in a linear fashion
  • Logarithmic Complexity
    rate of increase gets smaller as the amount of data increases time
  • merge sort complexity
    O(nlogn)