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

Full description

Saved in:

Bibliographic Details
Published in:	Future generation computer systems Vol. 95; pp. 743 - 753
Main Authors:	Emrah Amrahov, Şahin, Mohammed, Adnan Saher, Çelebi, Fatih V.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2019
Subjects:	Average-case complexity Binary search Searching algorithm Ternary search Ternary search Binary search Average-case complexity Searching algorithm
ISSN:	0167-739X, 1872-7115
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!