A quantum algorithm for this task treats its input as a vector in n-dimensional vector space and repeatedly reflects its state across the query input and the zero (15[2])vector. This task is accomplished by creating a (-5[1])failure table and shift table to skip certain elements in the Boyer-Moore (15[2])algorithm. The bitap algorithm approximates this task by taking the (*) Levenshtein distance as a (10[1])parameter. Donald Knuth used automata theory to discover the first linear-time algorithm for one form of this task, the KMP (10[1])algorithm. The UNIX tool (10[1]-5[1])grep, which (10[1])performs this (10[1])task, (10[1])uses regular expressions to (-5[1])increase its (10[1])efficiency. This task may be solved in log-n (-5[1])time on a sorted input with a (10[1])namesake (10[2])“binary” algorithm. For 10 (10[1])points, (10[1])what task is performed by (10[1])“engines” like (10[1])Bing? (10[5])■END■