Three Hundred - Sixteen Commit: Implement skeleton HashTableLinearProbe Class

Author: AAdewunmi

Section_11(Hash-Table)/(1)_hash-table-chaining.py

@@ -13,12 +13,14 @@
 # Hash tables enable very efficient searching. In the best case, data can be retrieved from a hash table
 # in constant time, so you will find them wherever high performance searching is a requirement. Maintaining
 # (adding, updating and deleting) data in a hash table is also very efficient.
+
+# Source: Hash Tables by isaaccomputerscience.org
+# URL: https://isaaccomputerscience.org/concepts/dsa_datastruct_hash_table?examBoard=all&stage=all
+
 #
-# Implement Hashing using Chaining method
+# Hash Table (Dealing with collisions using Chaining Method)
 # Chains are represented using LinkedList
 #
-# Source: Hash Tables by isaaccomputerscience.org
-# URL: https://isaaccomputerscience.org/concepts/dsa_datastruct_hash_table?examBoard=all&stage=all
 
 from linkedlist import LinkedList
 class HashChain:

Section_11(Hash-Table)/(2)_hash-table-linear-probing.py

@@ -0,0 +1,16 @@
+# Hash Table (Dealing with collisions using Linear Probing)
+# =========================================================
+# Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for
+# maintaining a collection of key–value pairs and looking up the value associated with a given key.
+# It was invented in 1954 by Gene Amdahl, Elaine M. McGraw, and Arthur Samuel and first analyzed in 1963 by Donald Knuth.
+#
+# Along with quadratic probing and double hashing, linear probing is a form of open addressing. In these schemes,
+# each cell of a hash table stores a single key–value pair. When the hash function causes a collision by mapping
+# a new key to a cell of the hash table that is already occupied by another key, linear probing searches the table for
+# the closest following free location and inserts the new key there. Lookups are performed in the same way, by searching
+# the table sequentially starting at the position given by the hash function, until finding a cell with a matching key
+# or an empty cell.
+class HashTableLinearProbe:
+    def __init__(self):
+        self.hashtable_size = 10
+        self.hashtable = [0] * self.hashtable_size