How to painlessly implement an associative array using a hash table.
Hash Tables
When it comes to the literature Hash Tables are often glossed over. Data Structures and Algorithms(DSA) books tend to focus on more complicated,
Exploring the 'Skip List' data structure as an alternative to self balancing Binary Search Trees for key/value pairs
What's a 'Skip List'?
A skip list is a data structure that was developed due to some of the 'unpleasant' asp
In this article I show how to implement Dijkstra's algorithm to show the shortest route by train through several American cities.
Sorting: Faster is Better
Tree sort is one of the less discussed sorting algorithms. The three elementary sorting Algorithms bubble sort, insertion sort, and selection sort are all worst case quadratic time algorithms.
A look at the three most common elementary sorting algorithms using perl
The First Three
When learning about sorting algorithms, or whenever one talks about sorting algorithms, there are three elementary sorting algorithms th
-
Exact Match String Searching: The Knuth-Morris-Pratt Algorithm
-
The visitor pattern: OOP takes on the Expression Problem
-
Improving mgcLisp's define syntax
-
Separating the Men from the Boys, Knuth Style
-
Reducing rotations during deletion from AVL trees
-
Parsing Lisp: From Data To Code
-
Swiz Heaps: A deterministic modification of Randomized Meldable Heaps
-
Let's talk Eval/Apply
-
BST Deletion: Removal By Merge
-
Dictionary Based Compression: The LZW Algorithm