Loading animations
Algorithms
Sort every suffix of a string and searching becomes binary search, because every occurrence of a pattern lands in one contiguous block. Then see the memory bill that made the Burrows-Wheeler transform necessary.
“Suffix arrays and binary search” is for subscribers. Start with a free account — it takes a name and an email — then subscribe for $1 a month to open it.