
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer—no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera, scan the code below and download the Kindle app.
Follow the author
OK
Data Structures and Algorithm Analysis in C: International Edition Paperback – 1 June 2003
There is a newer edition of this item:
$296.24
(100)
Only 1 left in stock.
Mark Allen Weiss' successful book provides a modern approach to algorithms and data structures using the C programming language. The book's conceptual presentation focuses on ADTs and the analysis of algorithms for efficiency, with a particular concentration on performance and running time. The second edition contains a new chapter that examines advanced data structures such as red black trees, top down splay trees, treaps, k-d trees, and pairing heaps among others. All code examples now conform to ANSI C and coverage of the formal proofs underpinning several key data structures has been strengthened.
- Print length600 pages
- LanguageEnglish
- PublisherPearson
- Publication date1 June 2003
- Dimensions19 x 2.2 x 23.5 cm
- ISBN-100321189957
- ISBN-13978-0321189950
Customers who viewed this item also viewed
Product description
From the Back Cover
In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 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. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C with the extensive use of figures and examples showing the successive stages of an algorithm, his engaging writing style, and a logical organization of topics.
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
- Publisher : Pearson; 2 edition (1 June 2003)
- Language : English
- Paperback : 600 pages
- ISBN-10 : 0321189957
- ISBN-13 : 978-0321189950
- Dimensions : 19 x 2.2 x 23.5 cm
- Customer Reviews:
About the author

Discover more of the author’s books, see similar authors, read author blogs, and more
Customer reviews
Top reviews from other countries

Data structures and Algorithm analysis is not an easy subject to master, you have to be prepared for work hard, and do lots of problems before you really appreciate the subject. There are lots of books out there, which try to dumb down the subject - I believe that is a false economy of effort. This author does not take that approach, he instead presents a treatment of Data structures and algorithm which sets you on the course to mastery.
I can't stress enough how much systematically working through the problems in this book, helped my in my day to day programming life.


when I realized that I absolutely must have a copy of my
own. The book contains all the information that I would
need for the annual ACM programming contest, and as an added
plus, its written with regards to my programming language
of choice, C.
A must have reference.