| Abstract: | A lab exercise in generating permutations can be very effective in two different computer science courses. In a first‐year computer science course, it is a good exercise in recursion, since it would be very difficult to do the problem without recursion. Second, in a Computer Organization or Assembly Language course, it reinforces very well the concepts of recursion and the use of a stack in implementing recursion, and drives home the idea that advanced data structures can be used in assembly language. Further concepts illustrated are the importance of analysing whether parameters should be var or value parameters, and the potential uses for a hardware stack. |
