Parts 1-4 of Robert Sedgewick's work provide extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications.
They reflect the third edition's greater emphasis on abstract data types (ADTs). Coverage includes more than 100 key algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations. Also included are new implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, and multiway tries.
Increased quantitative information gives students a more solid basis for comparing algorithms, and hundreds of new exercises reinforce their learning. Algorithms and data structures described in the book are expressed in concise implementations in C, so that students can both appreciate their fundamental properties and test them on real applications.
Buy Algorithms in C by Robert Sedgewick from Australia's Online Independent Bookstore, Boomerang Books.
Book DetailsISBN: 9780201314526
» Have you read this book? We'd like to know what you think about it - write a review about Algorithms in C book by Robert Sedgewick and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.0201314525AB06262002
© 2003-2019. All Rights Reserved. Eclipse Commerce Pty Ltd - ACN: 122 110 687 - ABN: 49 122 110 687