Skip to content

Fix typo in README regarding hash table principles #57

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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix typo in README regarding hash table principles #57

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
2 changes: 1 addition & 1 deletion 01-introduction/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ index, and use the index to find it in the array.
Array indexing has algorithmic complexity `O(1)`, making hash tables fast at
storing and retrieving data.

Our hash table will map string keys to string values, but the principals
Our hash table will map string keys to string values, but the principles
given here are applicable to hash tables which map arbitrary key types to
arbitrary value types. Only ASCII strings will be supported, as supporting
unicode is non-trivial and out of scope of this tutorial.
Expand Down