Merge pull request jamesroutley#13 from medium-endian/master

Minor nitpicks

03-hashing/README.md

@@ -21,7 +21,7 @@ function hash(string, a, num_buckets):
     hash = 0
     string_len = length(string)
     for i = 0, 1, ..., string_len:
-        hash += (a ** string_len - (i+1)) * char_code(string[i])
+        hash += (a ** (string_len - (i+1))) * char_code(string[i])
     hash = hash % num_buckets
     return hash
 ```

04-collisions/README.md

@@ -30,7 +30,7 @@ and over. We can mitigate this by adding 1 to the result of the second hash,
 making sure it's never 0.
 
 ```
-index = hash_a(string) + i * (hash_b(string) + 1) % num_buckets
+index = (hash_a(string) + i * (hash_b(string) + 1)) % num_buckets
 ```
 
 ## Implementation

05-methods/README.md

@@ -91,13 +91,13 @@ void ht_delete(ht_hash_table* ht, const char* key) {
     ht->count--;
 }
 ```
+After deleting, we decrement the hash table's `count` attribute.
 
 We also need to modify `ht_insert` and `ht_search` functions to take account of
 deleted nodes.
 
 When searching, we ignore and 'jump over' deleted nodes. When inserting, if we
-hit a deleted node, we can insert the new node into the deleted slot. After
-deleting, we decrement the hash table's `count` attribute.
+hit a deleted node, we can insert the new node into the deleted slot.
 
 ```c
 // hash_table.c

06-resizing/README.md

@@ -21,11 +21,12 @@ We will resize:
 To resize, we create a new hash table roughly half or twice as big as the
 current, and insert all non-deleted items into it.
 
-Our new array size should be a prime number roughly double the current size.
-Finding the new array size isn't trivial. To do so, we store a base size, which
-we want the array to be, and then define the actual size as the first prime
-larger than the base size. To resize up, we double the base size, and find the
-first larger prime.
+Our new array size should be a prime number roughly double or half the current
+size.  Finding the new array size isn't trivial. To do so, we store a base
+size, which we want the array to be, and then define the actual size as the
+first prime larger than the base size. To resize up, we double the base size,
+and find the first larger prime, and to resize down, we halve the size and
+find the next larger prime.
 
 Our base sizes start at 50. Instead of storing
 
@@ -114,7 +115,7 @@ with the desired size. All non `NULL` or deleted items are inserted into the new
 hash table. We then swap the attributes of the new and old hash tables before
 deleting the old.
 
-```
+```c
 // hash_table.c
 static void ht_resize(ht_hash_table* ht, const int base_size) {
     if (base_size < HT_INITIAL_BASE_SIZE) {