Abstract
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).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1990). On the deisng of an in-situ permutation algorithm. In: On the Shape of Mathematical Arguments. Lecture Notes in Computer Science, vol 445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020921
Download citation
DOI: https://doi.org/10.1007/BFb0020921
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52849-4
Online ISBN: 978-3-540-47166-0
eBook Packages: Springer Book Archive