Since the introduction of the STL (Standard Template Library) the use of functors has been a prevalent part of writing C++. Most of the STL algorithms require the use of a functor. For example, the std::transform requires a function object that, given an input of the current value of the current position, it will return […]
Hey everyone (I assume someone reads this blog), it’s been a while since my last blog post. I have no real excuse other than to say I decided I need to take a little personal time to recharge my batteries. I’m back now and will be aiming to publish a new technical article on a weekly […]
In the earlier article, Lowest Common Ancestor (BST), I discussed how you can use the special ordering of a Binary Search Tree to quickly and easily identify the Lowest Common Ancestor of two nodes. Of course, not all trees are BSTs and so in this article we’ll look at a way of finding the LCA in […]
On all future code related posts, for all full working code examples, I’ll be provided a link to the Ideone online code editor. It’s a little like pastebin but with the bonus of allowing you to both fork and compile the code online.
The Binary Search Tree (BST) is a tree like data structure that allows for the quick lookup of data. They work by storing inserted data in a tree like structure that uses the “divide and conquer” approach to locate data. Each node in the tree has, at most, two children. The left hand side (lhs) node […]
So, my web hosting is provided by AtSpace.com and my DNS hosting is provided by Heart Internet. Why are they seperate? Well, it's simply that I originally purchased my domains with Heart but have changed web hosts a couple of times. Since my DNS is configured just how I like it and since it really […]
I recently passed my full motorcycle licence. It's something I've wanted to do for a long time but, only recently, actually decided to do something about it.