
Nonfiction
Track this book
You choose which shelves are public. Progress and read dates stay yours.
About
This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate…
Reviews
No reviews yet. Sign in to write the first.
Rating integrity
HealthyCounted ratings come from accounts older than 7 days and were made on or after publication. Finished readers weigh ×1.0. Readers who have not finished yet weigh ×0.5. Did-not-finish ratings are shown but not counted.
Editions
7 editions- Ebook · English · 2008Cambridge University Press · 9780511433887
- Other · English · 2019Cambridge University Press · 472 pages · 9781108735513
- Other · English · 2011Cambridge University Press · 9780511800191
- Other · English · 2008Cambridge University Press · 9780511436079
- Other · English · 2008Cambrige University Press · 456 pages · 9780521880374
- Other · English · 2008Cambridge University Press · 9780511436857
Computer TechnologyComputer algorithmsNonfictionData structures (computer science)






