Data Structures and Algorithm Analysis in C, 2/e
|
Author(s):
Author:
Mark Allen Weiss
- ISBN:9788177583588
- 10 Digit ISBN:8177583581
-
Price:Rs. 890.00
- Pages:528
- Imprint:Pearson Education
- Binding:Paperback
- Status:Not Available
-
|
In the second edition of this best-selling book, the author continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time.
Table of Content
- Introduction
- Algorithms Analysis
- Lists, Stacks, and Queues
- Trees
- Hashing
- Priority Queues (Heaps)
- Sorting
- The Disjoint Set ADT
- Graphs Algorithms
- Algorithm Design Techniques
- Amortized Analysis
- Advanced Data Structures and Implementation
|
Salient Features
- Includes a chapter on algorithm and design techniques that cover greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms and backtracking.
- Presents current topics and newer data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists and splay trees.
- Incorporates new results on the average case analysis of heapsort.
- Offers source code from example programme via anonymous FTP.
|
|
|
|
|