This repository contains my implementations of selected algorithms while studying Introduction to Algorithms.
- Insertion Sort
- Merge Sort
- Binary Search
- Fast Exponentiation
- Fibonacci Sequence (Naive, Linear, and Matrix Recursion)
- Strassen's Matrix Multiplication
- Heap Sort
- Radix Sort
- Median Selection (Deterministic Select)
- Hashing with Chaining
- Open Addressing Hashing
- Randomized Selection
- Randomized QuickSort
- Binary Search Tree
- Red-Black Tree
- Stack
- Doubly Linked List
- Circular Queue
- Longest Common Subsequence (LCS)
- Breadth-First and Depth-First Search on Graphs
- Dijkstra’s Algorithm for Single-Source Shortest Path
- Skip List
For full details, see CHANGELOG.md
Quick Guide to Introduction to Algorithms: How I Got Started in 10 Days (in Chinese)