Useful Links
1. Introduction to Algorithms
2. Algorithm Analysis
3. Brute-Force and Exhaustive Search
4. Divide and Conquer
5. Greedy Algorithms
6. Dynamic Programming
7. Backtracking and Branch-and-Bound
8. Graph Algorithms
9. String Matching Algorithms
10. Computational Complexity Theory
11. Advanced Topics in Algorithm Design
  1. Computer Science
  2. Algorithms and Data Structures

Algorithm Design and Analysis

1. Introduction to Algorithms
2. Algorithm Analysis
3. Brute-Force and Exhaustive Search
4. Divide and Conquer
5. Greedy Algorithms
6. Dynamic Programming
7. Backtracking and Branch-and-Bound
8. Graph Algorithms
9. String Matching Algorithms
10. Computational Complexity Theory
11. Advanced Topics in Algorithm Design
  1. String Matching Algorithms
    1. Problem Statement
      1. Naive String Matching
        1. Algorithm Description
          1. Implementation
            1. Time Complexity Analysis
              1. Worst-Case Examples
              2. The Rabin-Karp Algorithm
                1. Hash Function Design
                  1. Rolling Hash Technique
                    1. Algorithm Description
                      1. Collision Handling
                        1. Analysis
                          1. Best-Case
                            1. Average-Case
                              1. Worst-Case
                            2. The Knuth-Morris-Pratt Algorithm
                              1. Motivation
                                1. Prefix Function
                                  1. Preprocessing Phase
                                    1. Search Phase
                                      1. Analysis
                                        1. Implementation Details
                                        2. The Boyer-Moore Algorithm
                                          1. Bad Character Heuristic
                                            1. Good Suffix Heuristic
                                              1. Preprocessing Phase
                                                1. Search Phase
                                                  1. Analysis
                                                    1. Implementation Considerations
                                                    2. Finite Automata for String Matching
                                                      1. Automaton Construction
                                                        1. Matching Process
                                                          1. Analysis
                                                          2. Multiple Pattern Matching
                                                            1. Aho-Corasick Algorithm
                                                              1. Trie Construction
                                                                1. Failure Function
                                                                  1. Pattern Matching Process

                                                                Previous

                                                                8. Graph Algorithms

                                                                Go to top

                                                                Next

                                                                10. Computational Complexity Theory

                                                                © 2025 Useful Links. All rights reserved.

                                                                About•Bluesky•X.com