Hey this is my implemetation

Please Read the comments and let me know if you have any questions. What I am thinking is: if we implement Binary Search the search time of that is O(log n) hashtables are O(1), obviously hashing is faster. Let me know if you have any suggestions or concerns I am open to ideas