CLRS Algorithms

This repo is a GO realization of algorithms from book "Introduction to Algorithms" 3rd edition.

1. Foundations

• The Role of Algorithms in Computing
• Getting Started (Insertion sort)
• Growth of Functions
• Divide-and-Conquer (Matrix multiply)
• Probabilistic Analysis and Randomized Algorithms

2. Sorting and Order Statistics

• Heapsort + Priority queue
• Quicksort
• Sorting in Linear Time 1 2 3
• Medians and Order Statistics

3. Data Structures

• Elementary Data Structures
• Hash Tables
• Binary Search Trees
• Red-Black Trees
• Augmenting Data Structures (AVL tree)

4. Advanced Design and Analysis Techniques

• Dynamic Programming
• Greedy Algorithms
• Amortized Analysis

5. Advanced Data Structures

• B-Trees
• Fibonacci Heap
• Van Emde Boas Trees
• Data Structures for Disjoint Sets

6. Graph Algorithms

• Elementary Graph Algorithms
• Minimum Spanning Trees
• Single-Source Shortest Paths
• All-Pairs Shortest Paths
• Maximum Flow

7. Selected Topics

• Multithreaded Algorithms 1 2
• Matrix Operations
• Linear Programming
• Polynomials and the FFT
• Number-Theoretic Algorithms
• String Matching
• Computational Geometry
• NP-Completeness
• Approximation Algorithms