Recent posts:
Let’s code it: Fast dictionary search
Sometimes we are in the position in which we want to search quickly if a word is inside a set, or in this case a dictionary, of defined words. Tries could be...
Let’s code it: A-Maze-ing
In our work sometimes is nice to experiment and today we will try to build a maze. This will be the partial animated result!
Let’s code it: Compact tree (part 2)
In the previous post we defined the tree itself and the methods to add and delete a child. This post covers the pack and re-index functionality, this allows ...
Let’s code it: Compact tree (part 1)
You need a tree structure but you don’t want to pay the cost of single node allocation every time, moreover you want a structure cache friendly as much as po...
Let’s code it: Sentence/word generations
Are you planning to create a name generator or a sentence generator? Generate strings using Markov chains could be the easy solution.
Let’s code it: Compact symmetric matrices
You need to store a symmetric matrix, but you don’t want to waste space… The following should help you!