Prim's Minimum Spanning Tree Algorithm

Functional Enlightenment and the Java Streams API

Functional Programming with Java

Early in my career, I had a lead developer on a project who during code review, much to my chagrin, kept making me re-write what was in my opinion “perfectly good, working code”. To my lead however

Enforcing uniqueness of objects in std::set<> and std::unordered_set<>

Unique Collections

 Knowing that a collection is comprised of unique only items if a very useful thing indeed. It's so useful that this concept is the basis of one of the fundamental data structure: the Set. While this is not the on

The Heapsort algorithm

Ahh, Heaps. 

Heaps are one of those data structures that turn up everywhere. They serve a humble purpose: find the maximum value (depending on if you're using min or max ordering) of a set efficiently. It is this very purpose that imbues

Randomized Meldable Heaps: An alternative tree structure for the implementation of priority queue

Randomized Meldable Heaps

When it comes to priority queues, the binary heap is the go-to data structure when it comes to implementation, and with good reason. Binary heaps offer worst-case logarithmic complexity for all operations that i

Search
Recent Posts
Meta