On the deisng of an in-situ permutation algorithm

Part 0 Summaries ofthe expositional essays
Part of the Lecture Notes in Computer Science book series (LNCS, volume 445)


It is shown how the availability of an adequate notation, for permutation-valued expressions in this case, can be essential for the presentation of an algorithm and the design decisions leading to it. The choice of the notation was guided by constraints of manipulability, constraints that were met primarily by being frugal in the use of nomenclature (of subscripted variables in particular).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Personalised recommendations