A look into K-Dimensional Trees

By Brandon Wheeless, Junior at SMU studying Computer Science

Understanding Dinic’s Algorithm

A simple guide to understanding one of the most powerful algorithms…

Ropes

One of the most common data structures in programming is a string and some of the most common operations of a string are appending and…

The Rabin-Karp String Searching Algorithm

A detailed dive into the functionality of the Rabin-Karp…

Image Processing Algorithms: Canny Edge Detector

An explanation using the OpenCV C++ Library

Sieve of Atkin — The Theoretical Optimization of Prime Number Generation

An Introduction to A* and IDA*

If you begin to look into pathfinding algorithms, you are bound to encounter the A* algorithm. If you dig…

A tale of two strings — Folly’s fbstring vs Libstd++’s std::string

About libstd:

Trie Data Structure

Trie is a tree-based data structure used for efficiently retrieving a key from a large set of strings. Trie differs from…

Splay Tree Data Structure

Self Optimizing Binary Search Tree