Big O Notation

Big O Notation is a formal asymptotic notation used in algorithm analysis to classify the upper bound growth rate of an algorithm's time or space complexity in relation to input size.

15

Publications

533

Citations

45

Authors

22

Institutions

Publications per year

2017–2026

6

Variants

Landau Notation

Authors

45

  1. YC
    Yaw‐Wen Chang

    National Defense Medical Center, Taiwan

    2 publications · 20 citations

    1

    h-index

  2. JM
    Jonathan M. Borwein

    Dalhousie University, Canada

    1 publications · 17 citations

    1

    h-index

  3. DG
    Diego Ghezzi

    École Polytechnique Fédérale de Lausanne, Switzerland

    1 publications · 35 citations

    1

    h-index

  4. TT
    Trieu‐Kien Truong

    I-Shou University, Taiwan

    1 publications · 10 citations

    1

    h-index

  5. RR
    R. Rodney Howell

    University of Miami, United States

    1 publications · 18 citations

    1

    h-index

1–5 of 45

Venues

  1. Computational Intelligence and Neuroscience

    1 publications · 35 citations

    1

    h-index

  2. Journal of Applied Mathematics and Computation

    JMAC · 1 publications · 17 citations

    1

    h-index

  3. Journal of Robotics

    JR · 1 publications · 12 citations

    1

    h-index

  4. WikiJournal of Science

    1 publications · 51 citations

    1

    h-index

  5. 1

    h-index

1–5