Sorting is a process we encounter very often in everyday life. Additionally it is a fundamental operation in computer science. Having been one of the first intensely studied problems in computer science, many different sorting algorithms have been developed and analyzed. Although algorithms are often taught as part of the computer science curriculum in the context of a programming language, the study of algorithms and algorithmic thinking, including the design, construction and analysis of algorithms, has pedagogical value in mathematics education. This paper will provide an introduction to computational complexity and efficiency, without the use of a programming language. It will also describe how these concepts can be incorporated into the existing high school or undergraduate mathematics curriculum through a mathematical analysis of student-generated sorting algorithms.
"A Mathematical Analysis of Student-Generated Sorting Algorithms,"
The Mathematics Enthusiast: Vol. 16
, Article 15.
Available at: https://scholarworks.umt.edu/tme/vol16/iss1/15