EEEcube Books
Data Structures and Algorithm Analysis in C by Mark Allen Weiss
4.2 based on 5 reviews
Copyright (c) Pearson Education
|
ABOUT THIS BOOK: (Publisher Description)
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.
--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.
EEECUBE REVIEW:
*Recommended by Anna University *Good quality paper *Nicely Indexed and easily accessible This is the best book available in the market for this subject. It covers most of the topics. Go for this book if you truly want to gain knowledge about the subject. But if you want marks alone, then you may try other local-authored books.
USER REVIEW: (CLICK HERE to submit your review)
No reviews yet!
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.
--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.
EEECUBE REVIEW:
*Recommended by Anna University *Good quality paper *Nicely Indexed and easily accessible This is the best book available in the market for this subject. It covers most of the topics. Go for this book if you truly want to gain knowledge about the subject. But if you want marks alone, then you may try other local-authored books.
USER REVIEW: (CLICK HERE to submit your review)
No reviews yet!
|
|
Thank you for sharing this review. Algorithms are at the core of Computer Science; knowledge of algorithms and data structures is essential to develop solid programming skills as well as for programming interviews. Great blog. Data structure tutorial