New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

article: Big O notation Part 2, 3, dst #94

Open

ronnygunawan opened this issue Mar 30, 2022 · 0 comments

Labels

difficulty: easy good first issue help wanted

Contributor

ronnygunawan commented Mar 30, 2022

Part 2:

O(1), O(n), O(n^2), O(n^3) in real algorithm
Deep dive into O(log n): O(n) to O(log n) optimization (binary search, interpolation search)

Part 3:

Deep dive into O(1): hash map, hash table, bloom filter, programming challenge that can be solved in O(1) using math

Part 4:

Sorting algorithms, database indexing

ronnygunawan added good first issue help wanted labels

aldy505 added hacktoberfest difficulty: easy labels

aldy505 removed the hacktoberfest label

aldy505 added the hacktoberfest label

aldy505 removed the hacktoberfest label

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