Data structures, algorithms, and applications in C++
Sahni, Sartaj.
Data structures, algorithms, and applications in C++ - 2nd Edition. - Summit, NJ : Silicon Press, c2005. - xxiv, 792, 11 p. : illustrations ;
Included Index.
Part I. Preliminaries --
1. C++ review --
2. Performance analysis --
3. Asymptotic notation --
4. Performance measurement --
Part II. Data structures --
5. Linear lists: Array representation --
6. Linear lists: Linked representation --
7. Arrays and matrices --
8. Stacks --
9. Queues --
10. Skip lists and hashing --
11. Binary and other trees --
12. Priority queues --
13. Tournament trees --
14. Binary search trees --
15. Balanced search trees --
16. Graphs --
Part III. Algorithm-design methods --
17. The greedy method --
18. Divide and conquer --
19. Dynamic programming --
20. Backtracking (on the Web) --
21. Branch and bound (on the Web).
This text provides students with an introduction to data structures and algorithms. It emphasizes algorithm analysis and the development of efficient code, and includes important background material. Divided into three parts, the text features Data Structure Application sections at the end of each chapter in part two, Algorithm Application sections in each design method chapter in part three, and a gradual development of C++ features not found in C to help students with either a background in C or C++ to comprehend topics in the book.
0929306325 (alk. paper) 9780929306322
C++ (Computer program language)
Data structures (Computer science)
Computer algorithms.
Application software
005.133 / SAH
Data structures, algorithms, and applications in C++ - 2nd Edition. - Summit, NJ : Silicon Press, c2005. - xxiv, 792, 11 p. : illustrations ;
Included Index.
Part I. Preliminaries --
1. C++ review --
2. Performance analysis --
3. Asymptotic notation --
4. Performance measurement --
Part II. Data structures --
5. Linear lists: Array representation --
6. Linear lists: Linked representation --
7. Arrays and matrices --
8. Stacks --
9. Queues --
10. Skip lists and hashing --
11. Binary and other trees --
12. Priority queues --
13. Tournament trees --
14. Binary search trees --
15. Balanced search trees --
16. Graphs --
Part III. Algorithm-design methods --
17. The greedy method --
18. Divide and conquer --
19. Dynamic programming --
20. Backtracking (on the Web) --
21. Branch and bound (on the Web).
This text provides students with an introduction to data structures and algorithms. It emphasizes algorithm analysis and the development of efficient code, and includes important background material. Divided into three parts, the text features Data Structure Application sections at the end of each chapter in part two, Algorithm Application sections in each design method chapter in part three, and a gradual development of C++ features not found in C to help students with either a background in C or C++ to comprehend topics in the book.
0929306325 (alk. paper) 9780929306322
C++ (Computer program language)
Data structures (Computer science)
Computer algorithms.
Application software
005.133 / SAH