A fast natural algorithm for searching

Authors:
Joshua J. Arulanandham;Cristian S. Calude;Michael J. Dinneen
Affiliations:
Department of Computer Science, The University of Auckland, Auckland, New Zealand;Department of Computer Science, The University of Auckland, Auckland, New Zealand;Department of Computer Science, The University of Auckland, Auckland, New Zealand
Venue:
Theoretical Computer Science
Year:
2004

Citing 2
Cited 2

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Implementing Bead-Sort with P Systems

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation

Rainbow Sort: Sorting at the Speed of Light

Natural Computing: an international journal
Friction-based sorting

Natural Computing: an international journal

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this note we present two natural algorithms--one for sorting, and another for searching a sorted 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 unsorted 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.