Fabrice E Iyolo

Turn coke into code


Data structures

Radix trie - a simple way to sort binary values

A radix tree (also patricia trie or radix trie or compact prefix tree) is a space-optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. You can see more about the redix tree here.

Read more...

Young tableaus, one of the famous applications of the heap properties

A young tableau is a matrix (m x n) where the young tableau property (rows and columns of the matrix are sorted) is maintained. In order to maintain the Young tableau property we can consider any Young tableau as a modified heap, in which each element has two parent nodes (left and top), and two children nodes (right and down), so each element is then bigger or equals its parents nodes values and less or equals its children nodes values.

Read more...

A propos

Je suis techniquement fort, expérimenté, pratique et curieux. Je travaille depuis plus de 15 ans dans le domaine de technologies de l'information. Je suis passionné de technologie et de ses applications. J'ai des connaissances et des compétences étendues et approfondies dans les domaines de la cloud computing, des outils, de l'automatisation et de la business intelligence.

Contact