Mode-finding algorithms revisited

M. Kaykobad; Rezaul Alam Chowdhury; Md Sanaul Hoque

doi:10.1080/00207169808804722

Mode-finding algorithms revisited

M. Kaykobad
, Rezaul Alam Chowdhury
, Md Sanaul Hoque

Computer Science

Stony Brook University

Bangladesh University of Engineering and Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	253-263
Number of pages	11
Journal	International Journal of Computer Mathematics
Volume	69
Issue number	3-4
DOIs	https://doi.org/10.1080/00207169808804722
State	Published - 1998

Keywords

Binary search
Computational complexity
Mode finding

Access to Document

10.1080/00207169808804722

Cite this

@article{a9d55abcf16046f8acc7b73c3567def9,

title = "Mode-finding algorithms revisited",

abstract = "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.",

keywords = "Binary search, Computational complexity, Mode finding",

author = "M. Kaykobad and Chowdhury, \{Rezaul Alam\} and Hoque, \{Md Sanaul\}",

year = "1998",

doi = "10.1080/00207169808804722",

language = "English",

volume = "69",

pages = "253--263",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3-4",

}

TY - JOUR

T1 - Mode-finding algorithms revisited

AU - Kaykobad, M.

AU - Chowdhury, Rezaul Alam

AU - Hoque, Md Sanaul

PY - 1998

Y1 - 1998

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

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

KW - Binary search

KW - Computational complexity

KW - Mode finding

UR - https://www.scopus.com/pages/publications/11744325674

U2 - 10.1080/00207169808804722

DO - 10.1080/00207169808804722

M3 - Article

SN - 0020-7160

VL - 69

SP - 253

EP - 263

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 3-4

ER -

Mode-finding algorithms revisited

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this