Data Structures, Algorithms, and Applications in C++, Second Edition
- 14h 8m
- Sartaj Sahni
- Silicon Press
- 2005
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.
In this Book
-
C++ Review
-
Performance Analysis
-
Asymptotic Notation
-
Performance Measurement
-
Linear Lists—Array Representation
-
Linear Lists—Linked Representation
-
Arrays and Matrices
-
Stacks
-
Queues
-
Skips Lists and Hashing
-
Binary and Other Trees
-
Priority Queues
-
Tournament Trees
-
Binary Search Trees
-
Balanced Search Trees
-
Graphs
-
The Greedy Method
-
Divide and Conquer
-
Dynamic Programming
-
Backtracking (On the Web)
-
Branch and Bound (On the Web)
SHOW MORE
FREE ACCESS
YOU MIGHT ALSO LIKE
