Search | About | Preferences | Interact | Help | ||
150 million books. 1 search engine. |
› Find signed collectible books: 'Algorithms'
Hardcover: 657 pages Publisher: Addison-Wesley Pub (Sd); 2 Sub edition (April 1988) Language: English
More editions of Algorithms:
› Find signed collectible books: 'Algorithms (Addison-Wesley series in computer science)'
Book by Robert Sedgewick
More editions of Algorithms (Addison-Wesley series in computer science):
› Find signed collectible books: 'Algorithms in C++'
This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters present fundamental concepts, including a briefintroduction to data structures. Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms.This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs.
More editions of Algorithms in C++:
› Find signed collectible books: 'Algorithms in C Combined'
This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters present fundamental concepts, including a briefintroduction to data structures. Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms. This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs. 0201514257B04062001
More editions of Algorithms in C Combined:
› Find signed collectible books: 'Algorithms in C: Pt. 6-8: Strings, Geometry, and Advanced Topics'
More editions of Algorithms in C: Pt. 6-8: Strings, Geometry, and Advanced Topics:
› Find signed collectible books: 'Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd Edition) (Pts. 1-4)'
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.
HighlightsWhether 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.
More editions of Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition:
› Find signed collectible books: 'Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5)'
Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).
More editions of Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5):
› Find signed collectible books: 'Bundle of Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5)'
Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5. Together, these books are definitive: the most up-to-date and practical algorithms resource available. Sedgewick masterfully blends theory and practice, making Bundle of Algorithms in C, Third Edition an essential resource for computer science researchers, students, and working developers alike. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs. In both books, Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents.
More editions of Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition):
› Find signed collectible books: 'Algorithms in Java: Strings, Geometry, and Advanced Topics Pt. 6-8'
More editions of Algorithms in Java: Strings, Geometry, and Advanced Topics Pt. 6-8:
› Find signed collectible books: 'Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)'
For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. Michael Schidlowsky and Sedgewick have developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications. This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. Its four parts are fundamentals, data structures, sorting, and searching. It has expanded coverage of arrays, linked lists, strings, trees, ADT's, and object-oriented programming.
More editions of Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4):
› Find signed collectible books: 'Algorithms in Modula-3'
This latest version of Sedgewick's well-known book provides a comprehensive collection of algorithms implemented in the Modula-3 programming language. Readers will see how key algorithms can be implemented, run, debugged, and used in real applications.
More editions of Algorithms in Modula-3:
› Find signed collectible books: 'Algoritms in Java (Pt. 1-8)'
More editions of Algoritms in Java (Pt. 1-8):
› Find signed collectible books: 'Analytic Combinatorics'
Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.
› Find signed collectible books: 'Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5)'
Software developers and computer scientists have eagerly awaited this Java version of Robert Sedgewick's landmark text on algorithms. All five parts are completely revamped, illuminating today's best algorithms for an exceptionally wide range of tasks. This is a shrink-wrapped bundle of Algorithms in Java, 3/e, Parts 1-4 and Algorithms in Java, 3/e, Part 5. The price of the bundle is $10 off the cost of buying the volumes individually.
More editions of Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5):
› Find signed collectible books: 'Changing Structure of the UK Financial System (LECS)'
More editions of Changing Structure of the UK Financial System (LECS):
› Find signed collectible books: 'An Introduction to the Analysis of Algorithms'
By emphasizing the application of computer programming not only in success stories in the software industry but also in familiar scenarios in physical and biological science, engineering, and applied mathematics, Introduction to Programming in Java takes an interdisciplinary approach to teaching programming with the Java" programming language.
Elements of Programming: Your First Program; Built-in Types of Data; Conditionals and Loops; Arrays; Input and Output. Functions and Modules: Static Methods; Libraries and Clients; Recursion. Object-Oriented Programming: Data Types; Creating Data Types; Designing Data Types. Algorithms and Data Structures: Performance; Sorting and Searching; Stacks and Queues; Symbol Tables.
For all readers interested in introductory programming courses using the Java programming language.
More editions of An Introduction to the Analysis of Algorithms:
› Find signed collectible books: 'Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO)'
More editions of Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO):
› Find signed collectible books: 'Studyguide for Algorithms by Robert Sedgewick, ISBN 9780321573513'
More editions of Studyguide for Algorithms by Robert Sedgewick, ISBN 9780321573513:
› Find signed collectible books: 'Algorithmen in C++. Teil 1-4. i Informatik'
More editions of Algorithmen in C++. Teil 1-4. i Informatik:
› Find signed collectible books: 'Algorithmen in C. i Informatik'
More editions of Algorithmen in C. i Informatik:
› Find signed collectible books: 'Algorithmen. Pearson Studium - IT'
More editions of Algorithmen. Pearson Studium - IT:
› Find signed collectible books: 'Algorithmes en langage C: Cours et exercices'
More editions of Algorithmes en langage C: Cours et exercices:
› Find signed collectible books: 'Algorithmes en langage C: Cours et exercices (French Edition)'
More editions of Algorithmes en langage C: Cours et exercices (French Edition):
Founded in 1997, BookFinder.com has become a leading book price comparison site:
Find and compare hundreds of millions of new books, used books, rare books and out of print books from over 100,000 booksellers and 60+ websites worldwide.