todo.md

add more test cases

CH01 FUNDAMENTALS

• Case Study: Union-Find
  • QuickFind
  • QuickUnion
  • WeightedQuickUnion
  • UF (Weighted quick-union with path compression)

CH02 SORTING

• Selection
• Insertion
• Shell
• Merge
  • Merge: Top-down Mergesort
  • MergeX: Optimized Mergesort
  • MergeBU: Bottom-up Mergesort
• Quick
  • Quick
  • Quick3Way
• Heap
• Priority Queue
  • MaxPQ
  • MinPQ
  • IndexMinPQ
  • Client
    • TopM
    • Multiway

CH03 SEARCHING

• SequentialSearchST
• BinarySearchST
• Binary Search Tree (BST)
• RedBlackBST
• SeparateChainingHashST
• LinearProbingHashST
• Client
  • FrequencyCounter

CH04 GRAPHS

• Undirected Graphs
  • Graph
  • DepthFirstSearch
  • DepthFirstPaths
  • BreadthFirstPaths
  • ConnectedComponents
  • SymbolGraph
• Directed Graphs (Digraph)
  • Digraph
  • DirectedDFS
  • DepthFirstDirectedPaths
  • BreadthFirstDirectedPaths
  • SymbolDigraph
  • DirectedCycle
  • DepthFirstOrder
  • SymbolDiraph
  • Topological
  • KosarajuSharirSCC
  • EdgeWeightedDigraph
  • EdgeWeightedDirectedCycle
• Minimum Spanning Tree (MST)
  • EdgeWeightedGraph
  • LazyPrimMST
  • PrimMST
  • KruskalMST
• Shortest Paths (SP)
  • DijkstraSP
  • AcyclicSP
  • AcyclicLP: Acyclic Longest Paths
  • BellmanFordSP
  • Client
    • AcyclicLP Client: Critical Path Method
    • Arbitrage detection

CH05 STRINGS

• String Sorts
  • LSD
  • MSD
  • Quick3string
• Tries
  • TrieST
  • Ternary Search Trie (TST)
• Substring Search
  • BruteForce
  • Rabin-Karp algorithm
  • Knuth-Morris-Pratt algorithm
  • Boyer-Moore algorithm
• Regular Expressions
  • NFA

CH06 CONTEXT

• Suffix Arrays
  • SuffixArray
  • SuffixArrayX
  • Client
    • LRS: Longest Repeated Substring
    • LCS: Longest Common Substring