Abstract
There are basically two ways for structuring a book on data structures and algorithms: problem or paradigm oriented. We have mostly followed the first alternative because it allows for a more concise treatment. However, at certain occassions (e.g. section VIII.4 on the sweep paradigm in computational geometry) we have also followed the second approach. In this last chapter of the book we attempt to review the entire book from the paradigm oriented point of view.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mehlhorn, K. (1984). Algorithmic Paradigms. In: Data Structures and Algorithms 2. EATCS Monographs on Theoretical Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69897-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-69897-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69899-6
Online ISBN: 978-3-642-69897-2
eBook Packages: Springer Book Archive