For example, consider the problem of finding a 1 bit in a given 1000-bit string P. In this case, the candidate solutions are the indices 1 to 1000, and a candidate c is valid if P = 1.
Na primer, razmotriti problem pronalaženja 1 bita u datom 1000-bitnom nizu P. U ovom slučaju, kandidati rešenja su indeksi 1 to 1000, i kandidat c je validan ako P = 1.