Skip to content

Instantly share code, notes, and snippets.

@mikeymaio
Created March 31, 2017 19:44
Show Gist options
  • Save mikeymaio/b25bd594ff127c76b4308eb1d05a8405 to your computer and use it in GitHub Desktop.
Save mikeymaio/b25bd594ff127c76b4308eb1d05a8405 to your computer and use it in GitHub Desktop.
Big-O Drills
isEven has 0(1) run time complexity
areYouHere has O(n^2) run time complexity
doubleArrayValues has O(n) run time complexity
naiveSearch has O(n) run time complexity
createPairs has O(n^2) run time complexity
generateFib has O(n) run time complexity
efficientSearch has O(log n) run time complexity
findRandomElement has O(1) run time complexity
isPrime has O(n) run time complexity
@douglas-mason
Copy link

👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment