MaxGCoding.com

When it comes to data structures - especially self balancing data structures - it is no secret that the algorithms for removing an entry are often many, many times more complex than the algorithms for adding a value. Anyone w

Well, it looks like I'm back at it, implementing iterators for all the things and up this time: In-memory B Trees. Now, It's no secret that that an iterator for an ordered container is simply an In-order traversal performed step-wise over said

When it comes to self balancing binary search trees it is almost always assumed that the balance one is referring to is that of access path length. The "traditional" definition of a balanced binary search tree is a tree where the difference in

Well, It looks like I'm back with another Recursive Descent post. This time I'm going to learn you how to parse those pesky Nth dimensional array references and deeply nested object members using recursive descent. So grab some coffee, strap in, and le

To use map/filter/reduce on lists would for the longest time immediately identify you as a lisp hacker. Overtime the immense utility of these list operations have led to their being incorporated by more and more mainstream languages. Now you can find t