Why Big-O and Little-O in Algorithm Complexity: A Pedagogical Remark

Authors

Olga Kosheleva, The University of Texas at El PasoFollow
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

4-2015

Comments

Technical Report: UTEP-CS-15-26

Abstract

In the comparative analysis of different algorithm, O- and o-notions are frequently used. While their use is productive, most textbooks do not provide a convincing student-oriented explanation of why these particular notations are useful in algorithm analysis. In this note, we provide such an explanation.