But after this, you will.
In this assignment, you will engage in a test-driven development process to implement a hash table, an unordered key-value data structure providing O(1) store, retrieve, search and delete operations.
python3 -m unittest test_hash_table
Open both test_hash_table.py and hash_table.py in your editor of choice. Modify the implementation in hash_table.py to pass the first test. Once it passes, create a commit. Then, uncomment the next test, and re-run the test suite. Implement what's necessary to pass the test, and then repeat this process.
But wait!
Toward the middle of the test suite, you should be thinking about the algorithmic efficiency of each operation. What should be O(1)? What should be linear? In addition, try to implement your operations using recursion, whenever appropriate.
Get together with a colleague in front of just one machine, and take turns being the driver. Change drivers after each test is passed. Don't forget to commit after each test.
(c) 2019 Yong Joseph Bakos. All rights reserved.