Recursion
Recursive Depth-First Search
A recursive depth-first search algorithm that explores branches deeply before backtracking, managing traversal state with recursion.
- Time complexity of insertion and deletion is Constant, i.e. O(1)
- Time complexity of search is is Linear, i.e. O(n)
- Space complexity is Linear, i.e. O(n)
Suffix Array
The suffix array algorithm constructs a sorted array of all suffixes of a given string, enabling efficient substring searches, pattern matching, and text analysis. It uses sorting and optional auxiliary structures like the LCP array for additional optimizations.