Mode-finding algorithms revisited

An iterative algorithm based on binary search has been presented for finding the mode of a sorted array and its frequency. Complexity of the algorithm has been deduced. Numerical experiments show its supremacy over the iterative implementation of Griffiths' algorithm.

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 69; no. 3-4; pp. 253 - 263
Main Authors Kaykobad, M., Chowdhury, Rezaul Alam, Sanaul Hoque, MD
Format Journal Article
LanguageEnglish
Published Abingdon Gordon and Breach Science Publishers 01.01.1998
Taylor and Francis
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Binary search
computational complexity
Computer science; control theory; systems
Exact sciences and technology
F.2.2
G.2.1
mode finding
Theoretical computing
Binary search
Iterative method
Griffith algorithm
Computational complexity
Search algorithm
Mode finding
Online AccessGet full text

Cover

More Information
Summary:An iterative algorithm based on binary search has been presented for finding the mode of a sorted array and its frequency. Complexity of the algorithm has been deduced. Numerical experiments show its supremacy over the iterative implementation of Griffiths' algorithm.
ISSN:0020-7160
1029-0265
DOI:10.1080/00207169808804722