How can i....
An interesting issue many new programmers come up against when first getting their feet wet is the scenario of implementing a function that either MUST return multiple variables, or would greatly benefit from doing so. Thou
Extensible Sorting
You may have encountered this situation before: You have a collection of objects that need sorting, but you want to be able to sort the objects differently depending upon which value or values you use to sort them. In
The Collatz Conjecture
The Collatz conjecture is an interesting "open" math problem regarding sequence generation. First proposed in 1937, the conjecture states that if you start with any positive integer(n), and if its
Visualizing Trees
If you've ever implemented a tree based data structure, chances are when it came time to display the tree, you were left scratching your head. Sure, different tree traversal algorithms allow us to print the contents in
Algorithmic Problems
The practice of generalizing issues in algorithmic design as "problems" predates the invention of computers. One such example is "The hamiltonian circuits problem" in graph theory which is a generalization of the "tr
-
Procedural Map Generation with Binary Space Partitioning
-
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