Fast sub string searching in amortized O(d) with Suffix Trees
There are a lot of ways to test if a string is contained within another
Refactoring: Improving your code
Modern software engineering is an iterative process. In agile methodologies, the aim is to end
Algorithm Visualization Techniques & Data Observation
Often times when designing or learning a new algorithm it is beneficial to have a
Displaying Binary Search Trees
Have you ever wanted to display a binary search tree while conveying its structural make
Langton’s Ant: Exploring State Machines through Cellular Automata
I’ve been covering some heavy topics lately with my Stack Machine & Compiler series, so