Sign in to save your progress, vote, and build your own decks.Sign in
Big O
7 cards·by luc-yahoo
Phone book is an example of
binary search
quicksort big o
n log n
bubble sort big o
o(n2)
example of O2n
2 loops not nested
O(2n) simplifies to
O(n)
O(n) aka
Constant time
O (log n)
cut the problem in half each time