Another classical analog of Grover's quantum search
arXiv:1411.6551
Abstract
In this work I describe a classical analog of Grover's quantum searching algorithm, explaining why a quantum algorithm should be able to perform search in O(sqrtN) steps and also acting as a useful pedagogic demonstration.
Word count of this version : 2601