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

Implementing "foreach" for custom containers

Foreach

The "foreach" loop is a special case of the for loop, usually enacted on a linear container such as an array or a list, where for every iteration of the loop, some action is performed on a member of the container until that actio

Comb sort: Bubble sort learns from Donald Shell

Computer Sciences better mouse trap

In the beginning the large majority of sort implementations were the more commonly known quadratic sorts: selection sort, insertion sort, and the omnipresent bubble sort. Radix sort was in use for the physic

Iterative Quicksort: removing recursion via explicit stack

Quicksort

In my previous article on quick sort I covered in detail the recursive implementation of the famous sorting algorithm. A downside of Quick sort is that it has the potential to encounter worst-case quadratic complexity, which means t

The Desert Island Data Structure

If you were stuck on a desert island with just one data structure, which would it be and why?

This is a silly but fun question, and after giving it some thought, my answer most likely shouldn't surprise most readers: A balanced binary se

Search
Recent Posts
Meta