Open Data Structures (in pseudocode) Edition 0.1Gβ

Open Data Structures (in pseudocode) Edition 0.1Gβ

Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

Publication date: 01 Jan 2012

ISBN-10: n/a

ISBN-13: n/a

Paperback: 326 pages

Views: 1,566

Type: Textbook

Publisher: n/a

License: Creative Commons Attribution 2.5 Canada

Post time: 26 Feb 2021 12:00:00

Open Data Structures (in pseudocode) Edition 0.1Gβ

Open Data Structures (in pseudocode) Edition 0.1Gβ Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
Tag(s): Algorithms and Data Structures Python
Publication date: 01 Jan 2012
ISBN-10: n/a
ISBN-13: n/a
Paperback: 326 pages
Views: 1,566
Document Type: Textbook
Publisher: n/a
License: Creative Commons Attribution 2.5 Canada
Post time: 26 Feb 2021 12:00:00
Summary/Excerpts of (and not a substitute for) the Creative Commons Attribution 2.5 Canada:
You are free to:

Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click here to read the full license.
From the Book Description:

Pat Morin wrote:
Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

Data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and ajacency list representations; and B-trees.

The data structures in this book are all fast, practical, and have provably good running times. All data structures are rigorously analyzed and implemented in Java and C++. The Java implementations implement the corresponding interfaces in the Java Collections Framework.




About The Author(s)


Dr Pat Morin is a Professor in the School of Computer ScienceCarleton University. His research interests are Algorithms, Computational Geometry, Data Structures, Distribution-sensitive data structures, Computational statistics, and Graph Theory.

Pat Morin

Dr Pat Morin is a Professor in the School of Computer ScienceCarleton University. His research interests are Algorithms, Computational Geometry, Data Structures, Distribution-sensitive data structures, Computational statistics, and Graph Theory.


Book Categories
Sponsors