The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Math Structures for Computer Science
Math Structures for Computer Science
What makes big-O analysis difficult: understanding how students understand runtime analysis
Journal of Computing Sciences in Colleges
| Hi-index | 0.00 |
Understanding growth of functions using the standard big O definition and notation is a challenge for many undergraduate students. This paper presents an approach to teaching growth of functions that utilizes equivalence classes and partial ordering, identifies those mathematical concepts students should comprehend in order to understand the principles underlying growth of functions, demonstrates pedagogical inadequacies in existing order of complexity notation and definitions and gives a rationale for restricting functions under consideration to positive-valued, monotonic increasing.