New and improved search algorithms and precise analysis of their average-case complexity

In this paper, we consider the searching problem over ordered sequences. It is well known that Binary Search (BS) algorithm solves this problem with very efficient complexity, namely with the complexity θ(log2n). The developments of the BS algorithm, such as Ternary Search (TS) algorithm do not impr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Future generation computer systems Jg. 95; S. 743 - 753
Hauptverfasser:	Emrah Amrahov, Şahin, Mohammed, Adnan Saher, Çelebi, Fatih V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.06.2019
Schlagworte:	Average-case complexity Binary search Searching algorithm Ternary search Ternary search Binary search Average-case complexity Searching algorithm
ISSN:	0167-739X, 1872-7115
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!