Skip to content

Commit

Permalink
Merge pull request #28955 from Maddily/hash-map-fix-grammar
Browse files Browse the repository at this point in the history
HashMap Data Structure: Fix grammar in bucket growth section
  • Loading branch information
linkonsat authored Oct 17, 2024
2 parents b4f5a27 + 9186dce commit 27d9ccf
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
2 changes: 1 addition & 1 deletion javascript/computer_science/hash_map_data_structure.md
Original file line number Diff line number Diff line change
Expand Up @@ -154,7 +154,7 @@ You probably understand by this point why we must write a good hashing function

### Growth of a hash table

Let's talk about the growth of our buckets. We don't have infinite memory, so we can't have the infinite number of buckets. We need to start somewhere, but starting too big is also a waste of memory if we're only going to have a hash map with a single value in it. So to deal with this issue, we should start with a small array for our buckets. We'll use an array size `16`.
Let's talk about the growth of our buckets. We don't have infinite memory, so we can't have infinite number of buckets. We need to start somewhere, but starting too big is also a waste of memory if we're only going to have a hash map with a single value in it. So to deal with this issue, we should start with a small array for our buckets. We'll use an array of size `16`.

<div class="lesson-note lesson-note--tip" markdown="1">

Expand Down
2 changes: 1 addition & 1 deletion ruby/computer_science/hash_map_data_structure.md
Original file line number Diff line number Diff line change
Expand Up @@ -150,7 +150,7 @@ You probably understand by this point why we must write a good hashing method wh

### Growth of a hash table

Let's talk about the growth of our buckets. We don't have infinite memory, so we can't have the infinite number of buckets. We need to start somewhere, but starting too big is also a waste of memory if we're only going to have a hash map with a single value in it. So to deal with this issue, we should start with a small array for our buckets. We'll use an array size `16`.
Let's talk about the growth of our buckets. We don't have infinite memory, so we can't have infinite number of buckets. We need to start somewhere, but starting too big is also a waste of memory if we're only going to have a hash map with a single value in it. So to deal with this issue, we should start with a small array for our buckets. We'll use an array of size `16`.

<div class="lesson-note lesson-note--tip" markdown="1">

Expand Down

0 comments on commit 27d9ccf

Please sign in to comment.