Ah tries, the tree structure with a name that nobody can agree on how to pronounce. Oddly spelled name aside, Tries offer a convenient way to implement a collection of strings in a way which supports operations such as finding the longest common prefix
When comparing C and C++ to other popular programming languages like Java, C#, and python one of the big issues people bring up is that you "have to" manage dynamic memory manually. Aside from manual memory management not being nearly as big a deal as
Sometimes when I'm bored I reach for one of the various books of programming challenges, flip to a random page and work through random problems until I've had enough. This past weekend I flipped to a random page and was greeted
Software development is like a 3d-jig saw puzzle. Small "pieces" - in the form of basic instructions - are used to construct larger pieces of increasing complexity, such as sub routines, functions, and objects. At differing lev
I've always liked the selection sort algorithm. I'm not sure why, I think it's the frank simplicity of it. Unfortunately, it is amongst the slowest of sorting algorithms, and is firmly in the realm of theoretic interest over practical use. Yet still it
-
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
-
Taking Action: Compiling Procedures to P-Code