Algorithms

Nonfiction, Computers, Programming, Systems Analysis
Cover of the book Algorithms by Robert Sedgewick, Kevin Wayne, Pearson Education
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Robert Sedgewick, Kevin Wayne ISBN: 9780132762564
Publisher: Pearson Education Publication: February 21, 2011
Imprint: Addison-Wesley Professional Language: English
Author: Robert Sedgewick, Kevin Wayne
ISBN: 9780132762564
Publisher: Pearson Education
Publication: February 21, 2011
Imprint: Addison-Wesley Professional
Language: English

Essential Information about Algorithms and Data Structures

 

A Classic Reference

The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.

 

Broad Coverage

Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See algs4.cs.princeton.edu/code.

 

Completely Revised Code

New Java implementations written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

 

Engages with Applications

Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books.

 

Intellectually Stimulating

Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.

 

A Scientific Approach

Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.

 

Integrated with the Web

Visit algs4.cs.princeton.edu for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources.

 

Contents

Chapter 1: Fundamentals

Programming Model

Data Abstraction

Bags, Stacks, and Queues

Analysis of Algorithms

Case Study: Union-Find

 

Chapter 2: Sorting

Elementary Sorts

Mergesort

Quicksort

Priority Queues

Applications

 

Chapter 3: Searching

Symbol Tables

Binary Search Trees

Balanced Search Trees

Hash Tables

Applications

 

Chapter 4: Graphs

Undirected Graphs

Directed Graphs

Minimum Spanning Trees

Shortest Paths

 

Chapter 5: Strings

String Sorts

Tries

Substring Search

Regular Expressions

Data Compression

 

Chapter 6: Context

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Essential Information about Algorithms and Data Structures

 

A Classic Reference

The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.

 

Broad Coverage

Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See algs4.cs.princeton.edu/code.

 

Completely Revised Code

New Java implementations written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

 

Engages with Applications

Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books.

 

Intellectually Stimulating

Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.

 

A Scientific Approach

Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.

 

Integrated with the Web

Visit algs4.cs.princeton.edu for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources.

 

Contents

Chapter 1: Fundamentals

Programming Model

Data Abstraction

Bags, Stacks, and Queues

Analysis of Algorithms

Case Study: Union-Find

 

Chapter 2: Sorting

Elementary Sorts

Mergesort

Quicksort

Priority Queues

Applications

 

Chapter 3: Searching

Symbol Tables

Binary Search Trees

Balanced Search Trees

Hash Tables

Applications

 

Chapter 4: Graphs

Undirected Graphs

Directed Graphs

Minimum Spanning Trees

Shortest Paths

 

Chapter 5: Strings

String Sorts

Tries

Substring Search

Regular Expressions

Data Compression

 

Chapter 6: Context

More books from Pearson Education

Cover of the book Microsoft Dynamics CRM 4.0 Unleashed by Robert Sedgewick, Kevin Wayne
Cover of the book My Windows 8.1 Computer for Seniors by Robert Sedgewick, Kevin Wayne
Cover of the book Silverlight 4 Unleashed by Robert Sedgewick, Kevin Wayne
Cover of the book Facebook Me! A Guide to Socializing, Sharing, and Promoting on Facebook by Robert Sedgewick, Kevin Wayne
Cover of the book Windows Server 2008 Portable Command Guide by Robert Sedgewick, Kevin Wayne
Cover of the book Microsoft Office Professional 2013 for Touch Devices Plain & Simple by Robert Sedgewick, Kevin Wayne
Cover of the book Canon EOS M by Robert Sedgewick, Kevin Wayne
Cover of the book Learn How to Trade Options (Collection) by Robert Sedgewick, Kevin Wayne
Cover of the book iPhoto 08 for Mac OS X by Robert Sedgewick, Kevin Wayne
Cover of the book Adapting to Web Standards by Robert Sedgewick, Kevin Wayne
Cover of the book Mongrel (Digital Shortcut) by Robert Sedgewick, Kevin Wayne
Cover of the book From Oz to Kansas by Robert Sedgewick, Kevin Wayne
Cover of the book The iPod and iTunes Pocket Guide by Robert Sedgewick, Kevin Wayne
Cover of the book Level 3: Martin Luther King by Robert Sedgewick, Kevin Wayne
Cover of the book Succeeding with SOA by Robert Sedgewick, Kevin Wayne
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy