A (Known) Search Path

Similar Posts

  • Data Transformations

    Data transformation is often simple like splitting a full name into the first and last, or vice versa. However, sometimes it is more complicated, much more complicated. I once wrote a data converter which had to convert data stored in a file with the size of data store being a certain number of bytes into…

  • Quicksort

    While the Quicksort is relatively fast, O(nlog(n)) in terms of speed on average, a lot of programmers fear it because they don’t like, understand, or maybe even know about recursion.  Recursion is the process of a function calling itself. There is usually a slight penalty for recursion as each function call is slower than if…

  • Problems with XML

    XML was designed to be a be-all end-all data format. However there have been issues that have arisen from its use. Strict Implementations I’ve seen more than once where companies requesting data be sent via XML were really just text parsing a file. They’d require nodes that were not being used, and not having the…

  • Tower of Hanoi

    The Tower of Hanoi, sometimes called the Tower of Brahma puzzle, is one of the classic problems to look at if you want to learn recursion. This problem is good to understand how recursive solutions are arrived at and how parameters for this recursion are implemented. We look at the solution in another post. The…