The design of algorithms is one of the hardest topics of high school computer science. This is mainly due to the universality of algorithms as solution methods that guarantee the calculation of a correct solution for all potentially infinitely many instances of an algorithmic problem. The goal of this paper is to present a comprehensible and…

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,…