What IS Gopher?
Long before the Go programming language adopt the gopher as its logo, and before the "World Wide Web" came to dominate the the internet with HTTP, there was Gopher. Gopher was a menu driven text only protocol for deliveri
Graphs As a Data Structure
Graphs are an Abstract Data Type used to organize information and more importantly, how information is related such as the names of Cities and the roads that connect them, or individual people and their various
Say this one 10 times fast: Bidirectional Iterative Deepening Depth Limited Depth First Search
Bidirectional Iterative Deepening Depth First Search(BDIDDFS), some times also called Bidirectional Iterative Deepening Depth Limited Depth First S
The binary search algorithm allows use to search for an item in a sorted array with much faster results than performing a search linearly.
How to painlessly implement an associative array using a hash table.
Hash Tables
When it comes to the literature Hash Tables are often glossed over. Data Structures and Algorithms(DSA) books tend to focus on more complicated,
-
Ternary Search Tries: String Specific Ordered Symbol Tables
-
Digital Search Trees
-
Lossless Compression Part III: Huffman Coding
-
Lossless Compression Part II: The LZ77 Algorithm
-
Lossless Compression Part I: Working with Bits in a Byte Oriented World
-
Bottom Up AVL Tree: The OG Self-Balancing Binary Search Tree
-
A Different Take on Merge Sort: Binary Search Trees?
-
Deleting Entries From Open-Address Hash tables
-
Transform any Binary Search Tree in to a Sorted Linked List
-
From Regular Expressions To NFA by way of Abstract Syntax Trees: Thompsons Construction