Algorithms

Sedgewick, Robert

Wayne, Kevin

Addison-Wesley Professional

Named a Notable Book in the 21st Annual Best of Computing list by the ACM! Robert Sedgewick and Kevin Wayne’s Computer Science: An Interdisciplinary Approach is the ideal modern introduction to computer science with Java programming for both students and professionals. Taking a broad, applications-based approach, Sedgewick and Wayne teach through important examples from science, mathematics, engineering, finance, and commercial computing. The book demystifies computation, explains its intellectual underpinnings, and covers the essential elements of programming and computational problem solving in today’s environments. The authors begin by introducing basic programming elements such as variables, conditionals, loops, arrays, and I/O. Next, they turn to functions, introducing key modular programming concepts, including components and reuse. They present a modern introduction to object-oriented programming, covering current programming paradigms and approaches to data abstraction. Building on this foundation, Sedgewick and Wayne widen their focus to the broader discipline of computer science. They introduce classical sorting and searching algorithms, fundamental data structures and their application, and scientific techniques for assessing an implementation’s performance. Using abstract models, readers learn to answer basic questions about computation, gaining insight for practical application. Finally, the authors show how machine architecture links the theory of computing to real computers, and to the field’s history and evolution. For each concept, the authors present all the information readers need to build confidence, together with examples that solve intriguing problems. Each chapter contains question-and-answer sections, self-study drills, and challenging problems that demand creative solutions. Companion web site (introcs.cs.princeton.edu/java) contains <ul>
<li>Extensive supplementary information, including suggested approaches to programming assignments, checklists, and FAQs</li> <li>Graphics and sound libraries</li> <li>Links to program code and test data</li> <li>Solutions to selected exercises</li> <li>Chapter summaries</li> <li>Detailed instructions for installing a Java programming environment</li> <li>Detailed problem sets and projects</li> </ul> Companion 20-part series of video lectures is available at informit.com/title/9780134493831

Computer Science: An Interdisciplinary Approach

Computers & Technology

Computer Science

Today, anyone in a scientific or technical discipline needs programming skills. Python is an ideal first programming language, and Introduction to Programming in Python is the best guide to learning it. Princeton University’s Robert Sedgewick, Kevin Wayne, and Robert Dondero have crafted an accessible, interdisciplinary introduction to programming in Python that emphasizes important and engaging applications, not toy problems. The authors supply the tools needed for students to learn that programming is a natural, satisfying, and creative experience. This example-driven guide focuses on Python’s most useful features and brings programming to life for every student in the sciences, engineering, and computer science. Coverage includes <ul>
<li> Basic elements of programming: variables, assignment statements, built-in data types, conditionals, loops, arrays, and I/O, including graphics and sound </li> <li> Functions, modules, and libraries: organizing programs into components that can be independently debugged, maintained, and reused </li> <li> Object-oriented programming and data abstraction: objects, modularity, encapsulation, and more </li> <li> Algorithms and data structures: sort/search algorithms, stacks, queues, and symbol tables </li> <li> Examples from applied math, physics, chemistry, biology, and computer science—all compatible with Python 2 and 3 </li> </ul>
Drawing on their extensive classroom experience, the authors provide Q&amp;As, exercises, and opportunities for creative practice throughout. An extensive amount of supplementary information is available at introcs.cs.princeton.edu/python. With source code, I/O libraries, solutions to selected exercises, and much more, this companion website empowers people to use their own computers to teach and learn the material.

Introduction to Programming in Python: An Interdisciplinary Approach

Dondero, Robert

Programming

**Included in this Bundle** THE PRINT BOOK: This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book — including 50 algorithms every programmer should know — represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering and for students who use computation in the liberal arts. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. THE LECTURE SERIES: There are 24 lecture videos that will be streamed on the Informit.com site; each lecture is approximately 60 to 75 minutes in length and focuses on a specific topic related to the Algorithms book. The lecture videos introduce viewers to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations. They also cover graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context. The first 12 lecture videos cover elementary data structures, sorting, and searching. Topics covered in these videos include union-find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, red-black trees, separate chaining and linear probing hash tables, Graham scan, and id-trees. Lecture videos 13 through 24 focus on graph and string-processing algorithms. Topics covered in these lecture videos include depth-first search, breadth-first search, topological sort, Kosaraju-Sharir, Kruskal, Prim, Dijkistra, Bellman-Ford, Ford-Fulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, multiway tries, ternary search tries, Knuth-Morris-Pratt, Boyer-Moore, Rabin-Karp, regular expression matching, run-length coding, Huffman coding, LZW compression, and the Burrows-Wheeler transform. Used books, rentals, and purchases made outside of Pearson If purchasing or renting from companies other than Pearson, the access code for the Video Lectures may not be included, may be incorrect, or may be previously redeemed. Check with the seller before completing your purchase.

Algorithms, Fourth Edition: Book and 24-Part Lecture Series

This book is intended to survey the most important algorithms in use on computers today and teach the fundamental techniques to the growing population interested in becoming serious computer users.

Algorithms (Addison-Wesley series in computer science)

Programming Languages

Addison-Wesley

Hardcover: 657 pagesPublisher: Addison-Wesley Pub (Sd); 2 Sub edition (April 1988)Language: English

"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.." - Steve Summit, author of C Programming FAQs Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive. - William A. Ward, University of South Alabama Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. 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 1-4, 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. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language. Highlights <ul>
<li>Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures </li>
<li>Greater emphasis on abstract data types (ADTs) than in previous editions </li>
<li>Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations </li>
<li>New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more </li>
<li>Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them </li>
<li>Over 1000 new exercises to help you learn the properties of algorithms </li> </ul>
Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: <ul>
<li>A complete overview of graph properties and types </li>
<li>Diagraphs and DAGs </li>
<li>Minimum spanning trees </li>
<li>Shortest paths </li>
<li>Network flows </li>
<li>Diagrams, sample C code, and detailed algorithm descriptions </li> </ul>
The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.

Algorithms in C, Part 5: Graph 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 <ul>
<li>Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures </li>
<li>Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions </li>
<li>Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations </li>
<li>New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more </li>
<li>Increased quantitative information about the algorithms, giving you a basis for comparing them </li>
<li>Over 1000 new exercises to help you learn the properties of algorithms </li> </ul>
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.

Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition

Defines and explores the implementation and figures of the algorithms required for various applications, offering commentary, descriptions, and exercises for developers, researchers, and students.

Algorithms in C++ Part 5: Graph Algorithms

See the best price to sell, buy, or rent books by Sedgewick, Robert. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Sedgewick, Robert

See the best price to sell, buy, or rent books by Sedgewick, Robert. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Algorithms

Computer Science: An Interdisciplinary Approach

Introduction to Programming in Python: An Interdisciplinary Approach

Algorithms, Fourth Edition: Book and 24-Part Lecture Series

Algorithms (Addison-Wesley series in computer science)

Algorithms

Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching

Algorithms in C, Part 5: Graph Algorithms

Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition

Algorithms in C++ Part 5: Graph Algorithms