[−]
  • Search
Algorithms in C++, Parts 1-4 : Fundamentals, Data Structure, Sorting, Searching (3rd Edition)Blog this item
Look inside at: Amazon | Google

Similar books

Cover of "The C++ Standard Library"
The C++ Standard Library
Cover of "The C++ Programming Language"
The C++ Programming Language
Cover of "C++ FAQs"
C++ FAQs
Cover of "Scientific and Engineering C++"
Scientific and Engineering C++
Cover of "The Boost Graph Library User Guide and Reference Manual"
The Boost Graph Library User Guide and Reference Manual

Book Description

Robert Sedgewick has thoroughly rewritten and substantially expanded andupdated his popular work to provide current and comprehensive coverage ofimportant algorithms and data structures. Christopher Van Wyk and Sedgewickhave developed new C++ implementations that both express the methods in aconcise and direct manner, and also provide programmers with the practicalmeans to test them on real applications. Many new algorithms are presented, and the explanations of each algorithmare much more detailed than in previous editions. A new text design anddetailed, innovative figures, with accompanying commentary, greatly enhancethe presentation. The third edition retains the successful blend of theory andpractice that has made Sedgewick's work an invaluable resource for more than250,000 programmers! This particular book, Parts 1-4, represents the essential first half of Sedgewick'scomplete work. It provides extensive coverage of fundamental data structuresand algorithms for sorting, searching, and related applications. Although thesubstance of the book applies to programming in any language, theimplementations by Van Wyk and Sedgewick also exploit the natural matchbetween C++ classes and ADT implementations. Highlights

Expanded coverage of arrays, linked lists, strings, trees, and other basic

data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions

Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations

New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a

basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

Book Details
English Books
Paperback 752 Pages
Edition: 3
ISBN-10: 0201350882
ISBN-13: 9780201350883
Publisher: Addison-Wesley Professional
Pub date: Jul 13, 1998
Dimensions: 24 cm x 20 cm x 3 cm Just how big is that?
In another language:
Improve data of this book
Allowed tags <b> → bold, <i> → Italics

FAQ See all

How does the voting work?
Find a comment helpful / unhelpful? Cast your vote. Only one vote from each person will be counted. Every hour we gather all the votes, add them up, add some magic source, and there we have the new sorting for the comments on the page of this book!
I see mistakes in the book information. How can I fix it?

Under "Book details", there is a link labeled "Improve data of this book". You can use that form to send us the correct information.

Why do I sometimes see less people than from last time?
Under the aNobii logo is the location filter. The higher up you go, the more people you see.
Loading ...