/Big-o

Exercise solutions in the ' Grokking Algorithms' book :

  1. O(log n) = log2​(128)=7
  2. O(log n) = log2​(256)=8
  3. O(log n) , O(1)
  4. O(n)
  5. O(n)
  6. O(n)

Exercise solutions in the 'array and linked list' file :

  1. Q1: O(n)
  2. Q2: O(n))
  3. Q3: O(1))
  4. Q4: O({n}/{b})
  5. Q5: O(log n)
  6. Q6: O(sqrt{n})
  7. Q7: O(n)
  8. Q8: O(n)
  9. Q9: O(n^2)
  10. Q10: Compilation error, but if e = 0 then O(log n)