Collatz Conjecture: A simple recursive implementation

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

Simple Binary Tree Visualization

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

The Hungry Programmers Problem: Adventures in Concurrency

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

xorshift Pseudo Random Number Generators

 

Data Structures: dynamic arrays in C

How to implement vector style dynamic arrays in C.

Dynamic Arrays

Most programming languages today offer some implementation of dynamic arrays in their standard libraries. Dynamically typed languages such as Perl, Swift, and

Search
Recent Posts
Meta