Open Data Structures: An Introduction
dc.contributor.author | Morin, Pat | |
dc.contributor.author | Morin, Pat | en_US |
dc.date.accessioned | 2016-06-18T01:52:20Z | |
dc.date.available | 2016-06-18T01:52:20Z | |
dc.date.issued | 2013 | en_US |
dc.identifier.isbn | 978-1-9273563-8-8 | en_US |
dc.identifier.other | HPU3160243 | en_US |
dc.identifier.uri | https://lib.hpu.edu.vn/handle/123456789/21464 | |
dc.description.abstract | Chapter 1. Introduction. Chapter 2. Array-Based Lists. Chapter 3. Linked Lists. Chapter 4. Skiplists. Chapter 5. Hash Tables. Chapter 6. Binary Trees. Chapter 7. Random Binary Search Trees. Chapter 8. Scapegoat Trees. Chapter 9. Red-Black Trees. Chapter 10. Heaps. Chapter 11. Sorting Algorithms. Chapter 12. Graphs. Chapter 13. Data Structures for Integers. Chapter 14. External Memory Searching. | en_US |
dc.format.extent | 336tr. | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en_US |
dc.publisher | Au Press, Athabasca University | en_US |
dc.subject | Data structures | en_US |
dc.subject | Computer algorithms | en_US |
dc.subject | Computer science | en_US |
dc.title | Open Data Structures: An Introduction | en_US |
dc.type | Book | en_US |
dc.size | 1,718Kb | en_US |
dc.department | ICT | en_US |
Files in this item
This item appears in the following Collection(s)
-
ICT [127]