The most common decomposition perspective in computer science problem-solving is 'top-down', in which the problem at hand is divided into 'smaller' sub-problems. Yet there are more decomposition perspectives. In this paper we illuminate three additional perspectives and demonstrate their didactic value. The presentation is displayed in an apprenticeship manner, through different approaches for solving an intriguing algorithmic challenge - the problem of finding majority. Each of the three perspectives is tied to a variety of algorithmic problems and solutions, and elaborated as a pedagogical tool for teaching algorithms.
|Number of pages||5|
|Journal||SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)|
|State||Published - 2002|
|Event||Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education - |
Duration: 27 Feb 2002 → 3 Mar 2002