Hash Tables Part 1: Open Addressing with Linear Probing

In part one of my article on open address hash tables i discuss hash functions, initializing the table and buckets, as well as insertion and searching via linear probing. hashing

Priority Queues: Sorting's unsung hero, and the true champion of Graph Algorithms

Exploring binary heaps for efficiently implementing the Priority Queue ADT.

The Priority Queue ADT

Unlike a regular queue which operates on a first-in first-out fashion, or the Last-in First-out ordering of a stack, a priorit

Pretty(er) Tree Printing with Breadth First Traversal

Displaying Binary Search Trees

Despite the various methods for traversing a tree, displaying the actual structure visually is a more difficult task than one would think. We know that a pre-order traversal gives us some

RNG: Dice Rolls and Coin Tosses

Simulating Dice and Coin Flips

This is going to be a rather short article because its a pretty simple concept, though one that comes up repeatedly on various programming forums: How to you simulate a coin toss or the roll of a dice?

Creating a Simple FIFO Queue for C

First In, First Out

Queues are on of the most fundamental data structures in use. Queues are an ordered collection. Items are added in such a way that the first item added to the queue is the first Item to be removed. They pop everywhere

Search
Recent Posts
Meta