Skip to content

[pull] master from amejiarosario:master #7

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.

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

Merged
merged 5 commits into from
May 23, 2020
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
fix(book/map): fix typo on maps space complexity
  • Loading branch information
amejiarosario committed May 23, 2020
commit 2f24f57f989bb97f198bb32f6daa477d6075dc31
2 changes: 1 addition & 1 deletion book/content/part03/hashmap.asc
Original file line number Diff line number Diff line change
Expand Up @@ -301,7 +301,7 @@ Hash Map it’s very optimal for searching values by key in constant time *O(1)*
.2+.^s| Data Structure 2+^s| Searching By .2+^.^s| Insert .2+^.^s| Delete .2+^.^s| Space Complexity
^|_Index/Key_ ^|_Value_
| Hash Map (naïve) ^|O(n) ^|O(n) ^|O(n) ^|O(n) ^|O(n)
| Hash Map (optimized) ^|O(1)* ^|O(n) ^|O(1)* ^|O(1)* ^|O(1)*
| Hash Map (optimized) ^|O(1) ^|O(n) ^|O(1)* ^|O(1) ^|O(n)
|===
{empty}* = Amortized run time. E.g. rehashing might affect run time.
// end::table[]
Expand Down