search – The Problem of Search

Searching Strings

Finding a instances of a substring within a string is a fundamental problem. There are a few methods to do so:

• Brute Force – O(m*n)
• Rabin-Karp
• Knuth-Morris-Pratt
• Boyer-Moore

Searching Trees and Graphs

• Depth-First Search
• Breadth-First Search
• Belmman-Ford
• Floyd-Warshall
• Dijkstra
• A*