Geeks for Geeks: Booth’s Algorithm

Geeks for Geeks: Booth's Algorithm

An efficient algorithm was proposed by Booth (1980).[2] The algorithm uses a modified preprocessing function from the Knuth-Morris-Pratt string search algorithm. The failure function for the string is computed as normal, but the string is rotated during the computation so some indices must be computed more than once as they wrap around. Once all indices of the failure function have been successfully computed without the string rotating again, the minimal lexicographical rotation is known to be found and its starting index is returned.

Read full article from Geeks for Geeks: Booth's Algorithm