Data structures, algorithms, and applications in C++ /
Material type:
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
Main Library Stacks | Reference | 005.133 SAH (Browse shelf(Opens below)) | Available | 009505 | ||
![]() |
Main Library Stacks | Reference | 005.133 SAH (Browse shelf(Opens below)) | Available | 009110 |
Includes index.
Program performance; data representation; arrays and matrices; stacks; queues; skip lists and hashing; binary and other trees; priority queues; tournament trees; search trees; graphics; the greedy method; divide-and-conquer; dynamic programming; backtracking; branch-and-bound
This is an introductory text on data structures and algorithms which emphasises algorithm analysis and the development of efficient code. Important background material such as algorithm analysis methods and C++ specific constructs are reviewed
There are no comments on this title.