| Algorithm | Best Case Time | Average Case Time | Worst Case Time | Space Complexity |
|---|---|---|---|---|
| Naive Pattern Searching | O(n) | O(n) | or | O(1) |
| Naive Searching (Distinct Pattern Chars) | O(n) | O(n) | O(n) | O(1) |
| Rabin-Karp | O(n + m) | O(n + m) | (O(n * m)) | O(1) |
| Knuth-Morris-Pratt (KMP) | O(n) | O(n + m) | O(n + m) | O(m) |
1. Naive pattern matching (general + distinct case)
🔗 Naive Pattern Searching (General + Distinct Characters Optimization)