A fast natural algorithm for searching [2 citations — 1 self]
Download:
by Joshua J. Arulanandham, Joshua J. Arulan, Cristian S. Calude, Cristian S. Calude, Michael J. Dinneen, Michael J. Dinneen
Theoretical Computer Science, 320:3
http://www.cs.auckland.ac.nz/CDMTCS//researchreports/220joshua.pdf
Add To MetaCart
Abstract:
In this note we present two natural algorithms—one for sorting and another for searching a list of items. Both algorithms work in O ( √ N) time, N being the size of the list. A combination of these algorithms can search an unordered list in O ( √ N) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover’s algorithm which is probabilistic, our method is guaranteed correct. Two applications will conclude this note. 1
Citations
| 408 | A fast quantum mechanical algorithm for database search – Grover |
| 7 | Bead–Sort: A natural sorting algorithm – Arulanandham, Calude, et al. |
| 3 | Implementing Bead-Sort with P systems – Arulanandham - 2002 |
| 2 | The Bead–Sort. Animation – Arulanandham |
| 2 | The SquareList Data Structure, Dr – Sams - 2003 |
