index

📘 Algorithms MOC

A structured overview of various algorithms and data structures.

🔍 Topic 1 - The Z-Algorithm

• Exact Pattern Matching Problem
• Gusfield’s Z-Algorithm

⚡ Topic 2 - The Boyer-Moore Algorithm

• Introduction To The Boyer-Moore Algorithm
• The Bad Character Shift Rule
• The Good Suffix Shift Rule
• Implementing The Boyer-Moore Algorithm

🔁 Topic 3 - Burrows-Wheeler Transform

• Suffix Array
• The Burrows-Wheeler Transform Of A String
• Inverting The Burrows-Wheeler Transform Of A String
• Pattern Matching With Burrows-Wheeler Transform

🌲 Topic 4 - Linear Time Suffix Tree Construction

• Suffix-Based Tree Data Structures
• Overview Of Ukkonen’s
• Speeding Up Traversals With Suffix Links
• Ukkonens Optimisation Tricks
• Searching Through Suffix Trees

📦 Topic 5 - Data Compression Algorithms

• Introduction To Data Compression
• Prefix-Free Codes
• Prefix-Free Coding For Integers
• Lempel Ziv For Lossless Text Compressions

🔢 Topic 6 - Number Theoretic Algorithms

• Integer Multiplication
• Modular Exponentiation

🌿 Topic 7 - Fibonacci Heap

• Binary Heap Data Structure
• Circular Doubly Linked List
• Fibonacci Heaps
• Operations On Fibonacci Heaps
• Why Fibonacci Numbers Appear in Fibonacci Heaps

⚖️ Topic 8 - Amortised Analysis

• Amortised Analysis
• Amortised Analysis On K-Bit Counter
• Amortised Analysis On Fibonacci Heaps

🌳 Topic 9 - B-Trees

• Introduction To B-Trees
• Operations On B-Trees

📈 Topic 10 - Linear Programming

• Linear Programming
• Simplex Algorithm

🔗 Topic 11 - Matching Algorithms On Bipartite Graphs

• Bipartite Graphs & Matching
• Minimum-Cost Bipartite Graph Matching
• Hungarian Algorithm Example