Hashing with Chaining
Notes taken from "8. Hashing with Chaining"; MIT OpenCourseware 6.006: Introduction to Algorithms. Dictionary: Abstract Data Type Maintain a set of items, each »
Lower Bounds on Sorting
Lower Bounds can also be important within Computer Science. We can use different comparison models to show that with certain algorithms, we can get linear time »
AVL Insert - Maintaining the AVL Invariant
The algorithm for the insert operation on an AVL tree: Perform a standard BST insert: a. Traverse the tree looking for where to insert an item, »
The Pumping Lemma (for Regular Languages)
So apparently, this is the bit of formal logic at which all computer science undergrads quake in their boots. Guess I've got that to look forward »
Reverse Polish Notation
Using brackets in computing is sometimes an unnecessary complication. Using post-fix expressions ensures that only one order of operation is needed. Postfix is another name for »