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

Bloom Filters: A probabilistic data structure for testing set membership

Bloom Filters

Bloom filters have been around for a while, 1970 to be exact. They're not exactly the star of any university data structures class. There are much "sexier" (yeah, i know.) data structures like self balancing search trees, hash t

Hash Tables part 2: Separate Chaining.

Part 2: expanding the collision resolution repertoire

Welcome back for part two of my articles on hash tables. In my previous article i covered the basics of linear probing. In this article i will discuss another popular collision resolution t

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

Search
Recent Posts
Meta