Ternary Search
Ternary Search is a divide-and-conquer algorithm for locating a target value within a sorted array by recursively partitioning the search interval into three equal parts and determining which two-thirds of the interval may contain the target, thereby distinguishing it from binary search which splits the interval into two.
17
Publications
423
Citations
60
Authors
31
Institutions
Publications per year
2017–2026
8
Parents
17
Aditi Sarker, Partha Chakraborty, S. M. Shaheen Sha et al. · Journal of Computer and Communications · 2020 · 29 citations · Full text
1–5 of 17
60
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 60
31

Pennsylvania State University
State College, United States
2 h-index
3 publications
54 citations

Peking University
Beijing, China
2 h-index
5 publications
71 citations

Universiti Tenaga Nasional
Kuala Selangor, Malaysia
2 h-index
4 publications
92 citations
University at Buffalo, State University of New York
Buffalo, United States
1 h-index
1 publications
14 citations
Sony Computer Science Laboratories
Tokyo, Japan
1 h-index
4 publications
316 citations

Huazhong University of Science and Technology
Wuhan, China
1 h-index
4 publications
104 citations
Gannan Normal University
Ganzhou, China
1 h-index
2 publications
70 citations

University of Central Florida
Orlando, United States
1 h-index
3 publications
30 citations
1–8 of 31
Repository · 1 publications · 52 citations
1
h-index
EJP · 1 publications · 14 citations
1
h-index
1 publications · 16 citations
1
h-index
PRD · 1 publications · 26 citations
1
h-index
JCC · 1 publications · 29 citations
1
h-index
1–5