Open data structures : an introduction / / Pat Morin

• Record Nr.: UNINA9910139028803321
• Autore: Morin Pat
• Pubbl/distr/stampa: Athabasca University Press, 2013; Edmonton, Alberta : , : AU Press, , 2013; ©2013
• ISBN: 1-927356-39-3
• Edizione: [31th ed.]
• Descrizione fisica: 1 online resource (337 p.)
• Collana: OPEL (Open Paths to Enriched Learning)
• Disciplina: 005.73
• Soggetti: Data structures (Computer science); Computer algorithms
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.
• Sommario/riassunto: Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Analyzed and implemented in Java, with a mathematically rigorous approach, Morin clearly and briskly presents instruction along with source code. A modern treatment of an essential computer science topic, this text is a measured balance between classical topics and state-of-the-art structures that will serve the needs of all undergraduate