Two mathematical topics are interpreted from the viewpoints of traditional (performing algorithms) and contemporary (creating algorithms and thinking in terms of them for solving problems and developing theory) algorithmic mathematics. The two topics are Horner's method for evaluating polynomials and Gauss's method for solving systems of linear…

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

Various researchers have associated meaningful problem solving with methods guided directly by a conceptual knowledge base. By contast, a meaningless solving course, or sequence of operations, is essentially independent of the solver's conceptual understanding of the problem under consideration. This paper is the first to document a meaningless,…