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

Authors

60

  1. HS
    Hazim Shakhatreh

    Yarmouk University, Jordan

    2 publications · 46 citations

    2

    h-index

  2. AS
    Ahmad Sawalmeh

    Northern Border University, Saudi Arabia

    2 publications · 46 citations

    2

    h-index

  3. NS
    Noor Shamsiah Othman

    Universiti Tenaga Nasional, Malaysia

    2 publications · 46 citations

    2

    h-index

  4. NZ
    Nan Zhang

    The University of Texas at Arlington, United States

    1 publications · 10 citations

    1

    h-index

  5. YH
    Ying Huang

    Gannan Normal University, China

    1 publications · 35 citations

    1

    h-index

1–5 of 60

Venues

  1. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 52 citations

    1

    h-index

  2. Electronic Journal of Probability

    EJP · 1 publications · 14 citations

    1

    h-index

  3. Bioinformatics

    1 publications · 16 citations

    1

    h-index

  4. Physical review. D/Physical review. D.

    PRD · 1 publications · 26 citations

    1

    h-index

  5. Journal of Computer and Communications

    JCC · 1 publications · 29 citations

    1

    h-index

1–5