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

Celý popis

Podrobná bibliografie

Vydáno v:	Future generation computer systems Ročník 95; s. 743 - 753
Hlavní autoři:	Emrah Amrahov, Şahin, Mohammed, Adnan Saher, Çelebi, Fatih V.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.06.2019
Témata:	Average-case complexity Binary search Searching algorithm Ternary search Ternary search Binary search Average-case complexity Searching algorithm
ISSN:	0167-739X, 1872-7115
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!