A fast natural algorithm for searching

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...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 320; no. 1; pp. 3 - 13
Main Authors Arulanandham, Joshua J., Calude, Cristian S., Dinneen, Michael J.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 12.06.2004
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Data structures
Exact sciences and technology
Mathematics
Natural algorithms
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in probability and statistics
Sciences and techniques of general use
Searching
Theoretical computing
Natural algorithms
Searching
Data structures
Computer theory
Fast algorithm
Application
Algorithm complexity
Search algorithm
Sorting
Online AccessGet full text
ISSN0304-3975
1879-2294
DOI10.1016/j.tcs.2004.03.040

Cover

More Information
Summary: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2004.03.040