Data Structures and Algorithm Analysis in C (Paperback)

Data Structures and Algorithm Analysis in C Cover Image


Features * Includes a chapter on algorithm and design techniques that covers 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 * Contains a chapter on amortized analysis that examines the advanced data structures presented earlier in the book * Provides a new chapter on advanced data structures and their implementation covering red black trees, top down splay trees, treaps, k-d trees, pairing heaps, and more * Incorporates new results on the average case analysis of heapsort * Offers source code from example programs via anonymous FTP 0201498405B04062001.

About the Author

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley. 0201498405AB04062001

Product Details
ISBN: 9780201498400
ISBN-10: 0201498405
Publisher: Pearson
Publication Date: September 19th, 1996
Pages: 528
Language: English