A Software Engineering Space

Counting Islands with Flood Fill

Sometimes when I’m bored I reach for one of the various books of programming challenges, flip to a random page and work through random problems until I’ve had enough. This past weekend I flipped to a random page and was greeted with the “Counting Islands” problem. The problem goes like this: “You are a provided […]

Of Humble Constructs: The Event Loop

Software development is like a 3d-jig saw puzzle. Small “pieces” – in the form of basic instructions – are used to construct larger pieces of increasing complexity, such as sub routines, functions, and objects. At differing levels of abstraction this can be anything from combining basic arithmetical operations with a stack to create a RPN […]

Insertion Sorting Linked Lists

In yesterdays post I covered implementing selection sort for linked lists, so I figured I would cover Insertion sorting linked lists for the sake of completeness. I ended the selection sort article with assertion that for the complexity of implementing it compared to the performance of the actual algorithm that you are much better off […]

Selection Sorting a Linked List

I’ve always liked the selection sort algorithm. I’m not sure why, I think it’s the frank simplicity of it. Unfortunately, it is amongst the slowest of sorting algorithms, and is firmly in the realm of theoretic interest over practical use. Yet still it is studied because it’s useful instruction for how to construct a more […]