Picture 1 of 2
Stock photo
Picture 1 of 2
Stock photo
Algorithms in C++ Pts. 1-4 : Fundamentals, Data Structure, Sorting, Searching by Robert Sedgewick (1998, Trade Paperback)
Better World Books (2736300)
98.9% positive feedback
Price:
US $7.27
ApproximatelyAU $11.30
+ $17.60 postage
Returns:
30-day returns. Buyer pays for return postage. If you use an eBay postage label, it will be deducted from your refund amount.
Condition:
Book
- Buy It NowAlgorithms in C++ Pts. 1-4 : Fundamentals, Data Structure, Sortin
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherAddison Wesley Professional
ISBN-100201350882
ISBN-139780201350883
eBay Product ID (ePID)794689
Product Key Features
Number of Pages752 Pages
LanguageEnglish
Publication NameAlgorithms in C++ Pts. 1-4 : Fundamentals, Data Structure, Sorting, Searching
Publication Year1998
SubjectProgramming Languages / C++, Programming / Algorithms, Algebra / General, Software Development & Engineering / Systems Analysis & Design
FeaturesRevised
TypeTextbook
Subject AreaMathematics, Computers
AuthorRobert Sedgewick
FormatTrade Paperback
Dimensions
Item Height1.8 in
Item Weight41.4 Oz
Item Length9.2 in
Item Width7.8 in
Additional Product Features
Edition Number3
Intended AudienceScholarly & Professional
LCCN98-071799
Dewey Edition21
IllustratedYes
Dewey Decimal005.1/2/028
Table Of ContentFUNDAMENTALS. 1. Introduction. Algorithms. A Sample Problem-Connectivity. Union-Find Algorithms. Perspective. Summary of Topics. 2. Principles of Algorithm Analysis. Implementation and Empirical Analysis. Analysis of Algorithms. Growth of Functions. Big-Oh Notation. Basic Recurrences. Examples of Algorithm Analysis. Guarantees, Predictions, and Limitations. DATA STRUCTURES. 3. Elementary Data Structures. Building Blocks. Arrays. Linked Lists. Elementary List Processing. Memory Allocation for Lists. Strings. Compound Data Structures. 4. Abstract Data Types. Abstract Objects and Collections of Objects. Pushdown Stack ADT. Examples of Stack ADT Clients. Stack ADT Implementations. Creation of a New ADT. FIFO Queues and Generalized Queues. Duplicate and Index Items. First-Class ADTs. Application-Based ADT Example. Perspective. 5. Recursion and Trees. Recursive Algorithms. Divide and Conquer. Dynamic Programming. Trees. Mathematical Properties of Trees. Tree Traversal. Recursive Binary-Tree Algorithms. Graph Traversal. Perspective. SORTING. 6. Elementary Sorting Methods. Rules of the Game. Selection Sort. Insertion Sort. Bubble Sort. Performance Characteristics of Elementary Sorts. Shellsort. Sorting Other Types of Data. Index and Pointer Sorting. Sorting Linked Lists. Key-Indexed Counting. 7. Quicksort. The Basic Algorithm. Performance Characteristics of Quicksort. Stack Size. Small Subfiles. Median-of-Three Partitioning. Duplicate Keys. Strings and Vectors. Selection. 8. Merging and Mergesort. Two-Way Merging. Abstract In-Place Merge. Top-Down Mergesort. Improvements to the Basic Algorithm. Bottom-Up Mergesort. Performance Characteristics of Mergesort. Linked-List Implementations of Mergesort. Recursion Revisited. 9. Priority Queues and Heapsort. Elementary Implementations. Heap Data Structure. Algorithms on Heaps. Heapsort. Priority-Queue ADT. Priority Queues for Index Items. Binomial Queues. 10. Radix Sorting. Bits, Bytes, and Words. Binary Quicksort. MSD Radix Sort. Three-Way Radix Quicksort. LSD Radix Sort. Performance Characteristics of Radix Sorts. Sublinear-Time Sorts. 11. Special-Purpose Sorts. Batcher''s Odd-Even Mergesort. Sorting Networks. External Sorting. Sort-Merge Implementations. Parallel Sort/Merge. SEARCHING. 12. Symbol Tables and BSTs. Symbol-Table Abstract Data Type. Key-Indexed Search. Sequential Search. Binary Search. Binary Search Trees (BSTs). Performance Characteristics of BSTs. Index Implementations with Symbol Tables. Insertion at the Root in BSTs. BST Implementations of Other ADT Functions. 13. Balanced Trees. Randomized BSTs. Splay BSTs. Top-Down 2-3-4 Trees. Red-Black Trees. Skip Lists. Performance Characteristics. Separate Chaining. Linear Probing. Double Hashing. Dynamic Hash Tables. Perspective. 15. Radix Search. Digital Search Trees. Tries. Patricia Tries. Multiway Tries and TSTs. Text String Index Applications. 16. External Searching. Rules of the Game. Indexed Sequential Access. B Trees. Extendible Hashing. Perspective. Index. 0201350882T04062001
Edition DescriptionRevised edition
SynopsisInstructors, please visit http://algs4.cs.princeton.edu/home/ for companion content and information on requesting instructor resources For this version of Robert Sedgewick's popular textbook on algorithms and data structures, Christopher Van Wyk and Robert Sedgewick have developed new C++ implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications. This particular book, Parts 1-4, represents a substantial update of the first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The update features expanded coverage of arrays, linked lists, strings, trees, and other basic data structures, and greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1,000 new exercises to help students learn the properties of algorithms., Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between 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., Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between 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., This is the latest offering in the Algorithms series from esteemed author and former Donald Knuth student, Robert Sedgewick. Using C++, Parts 1-4 of Sedgewick's work provide extensive 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.
All listings for this product
Ratings and reviews
Most relevant reviews
- 15 Sep, 2018
A must have for the serious C++ programmers!
The book provides excellent content without a lot of fluff. The author is the creator of the Quick Sort algorithm, so you know this book is the supreme wizard's cookbook for efficiency in coding! This isn't some regurgitated content from a third rate professor at a third tier college. This is the real deal text book for only the most successful programmer's!Verified purchase: YesCondition: Pre-owned
