Skip to content

Instantly share code, notes, and snippets.

@ievgenk

ievgenk/gist:c0e2dbf6b509f88a09083b4c578521d0

Created October 11, 2018 04:34
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save ievgenk/c0e2dbf6b509f88a09083b4c578521d0 to your computer and use it in GitHub Desktop.
Save ievgenk/c0e2dbf6b509f88a09083b4c578521d0 to your computer and use it in GitHub Desktop.
Download ZIP
Big O drills
Raw
gistfile1.txt
Even or Odd = O(1)
Are you here = O(n^2)
Doubler = O(n)
Naive Search = O(n)
Creating Pairs = 0(n^2)
Computing fibonaccis = O(n)
An Efficient Search = O(log(n))
Random Element = O(1)
Is it prime = O(1)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment