Apostolico-Giancarlo, Knuth-Morris-Pratt, and Boyer-Moore are all fast algo
Apostolico-Giancarlo, Knuth-Morris-Pratt, and Boyer-Moore are all fast algorithms for searching within them. The Pascal variety has an encoded length count attached to its beginning, but the null-terminated variety is far more common. Generally encoded into binary by ASCII, in C and Java, constants of this type are surrounded by quotation marks. For 10 points—name this data structure, a series of ordered characters in which text can be stored.
Apostolico-Giancarlo, Knuth-Morris-Pratt, and Boyer-Moore are all fast algorithms for searching within them.
{string}s