mental1104 / Algorithm4

Code refactored by C++

Algorithm4-implemented by cpp

Usage:

mkdir build
cd build
cmake ..
make -j8

Then go to the bin directory to find those executable files

The following content is deprecated... Now refactoring the docs and code...

This is a personal note of reading Algorithm 4th.

All the code(specified by "Algorithm x.y) in this book are going to be implemented by c++.

Some testfiles are from the official website, like largeUF.txt, 32Kints.txt.

Chapter1 I try to avoid using STL cause they are basic data structure.

Chapter2 - Chapter5

For convenient change the size of array and random access, I use the vector STL to be the sorted array.
Since our handmade data structure doesn't support generic template and range-for statement. In the later implementation I use (and only use) STL.

For example, although we implement a basic structure 2.6 MinPQ, the std::priority_queue in is more convenient to use.

Environment: linux-ubuntu
Compiler: g++ 9

Chapter 1 Fundamental

1.3 Bags, Queues, and Stacks

• 1.1 stack Array-edition
• 1.2 Stack linked-list edition
• 1.3 Queue
• 1.4 Bag

1.5 Case Study: Union-Find

• 1.5 Union Find

Chapter 2 Sorting

2.1 Elementary Sorts

• 2.1 SelectionSort
• 2.2 InsertionSort
• 2.3 ShellSort

2.2 Mergesort

• 2.4 MergeSort

2.3 Quicksort

• 2.5 Quicksort

2.4 Priority Queues

Heap:

• 2.6 MaxPQ
• 2.6 MinPQ
• 2.7 heapsort

Chapter 3 Searching

3.1 Symbol Tables

• 3.1 Linked-List
• 3.2 BinarySearch

3.2 Binary Search Trees

• 3.3 BinarySearch Tree

3.3 Balanced Search Trees

• 3.4 Balanced-BinarySearch Tree/Red-Black Tree

3.4 Hash Tables

• 3.5 SeparateChain
• 3.6 LinearProbing

Chapter 4 Graph

4.1 Undirected Graph

• 4.1 Depth-First Search
• 4.2 Breadth-First Search
• 4.3 Connected Components

4.2 Directed Graph

• 4.4 Reachability
• 4.5 Topological Sort
• 4.6 Kosaraju's Algorithm for Computing Strong Components

4.3 Minimum Spanning Tree

• Undirected Weighted Graph
• Lazy version of Prim's MST algorithm
• 4.7 Prim's MST Algorithm(eager version)
• 4.8 Kruskal's MST Algorithm

4.4 Shortest Paths

• directed Weighted Graph
• 4.9 Dijkstra's Shortest-Paths Algorithm
• 4.10 Shortest Paths in Edge-Weighted DAGS
• 4.11 Bellman-Ford Algorithm(queue-based)

Chapter 5 String

5.1 String Sorts

• 5.1 LSD string sort
• 5.2 MSD string sort
• 5.3 Three-Way string quicksort

5.2 Tries

• 5.4 Trie Symbol Table
• 5.5 Tenary Search Trie

5.3 Substring Search

• 5.6 KMP
• 5.7 BoyerMoore
• 5.8 Rabin-Karp

5.4 Regular Expreesions

• 5.9 Regular-Expression

5.5 Data Compression

• 5.10 Huffman-Encoding Compression
• 5.11 LZW Compression