Image from Amazon.com
Data structures, algorithms, and applications in C++ / Sartaj Sahni
Call number: 621.C6424 S131D Material type:
TextPublication details: Boston : WCB/McGraw-Hill, c1998Description: xxiv, 824 p. : illus ; 24 cmISBN: - 0071092196
- 621.C6424 S131D
Partial contents:
Programming in C++ - - Program performance - - Data representation - - Arrays and matrices - - Stacks - - Queues - - Skip lists and hashing - - Binary and other trees - - Priority queues - - Tournament trees - - Search trees - - Graphs - - The greedy method - - Divide and conquer - - Dynamic programming - - Backtracking - - Branch and bound
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
General Book
|
PBRU Library บรรณราชฯ ชั้น 4 | หนังสือภาษาอังกฤษ ชั้น 4 | 621.C6424 S131D (Browse shelf(Opens below)) | 1 | Available | 1000081415 |
Programming in C++ - - Program performance - - Data representation - - Arrays and matrices - - Stacks - - Queues - - Skip lists and hashing - - Binary and other trees - - Priority queues - - Tournament trees - - Search trees - - Graphs - - The greedy method - - Divide and conquer - - Dynamic programming - - Backtracking - - Branch and bound
There are no comments on this title.
Log in to your account to post a comment.
