Scribd
Upload
25 views

Amazon Pearson Informit

This booksite contains tens of thousands of files that supplement an algorithms textbook. It includes excerpts from the textbook narrative, curated online videos, Java code examples and libraries, selected exercises and solutions, and programming assignments. The textbook itself surveys important algorithms and data structures used today, organized into six chapters covering fundamentals, sorting, searching, graphs, strings, and applications. The booksite is intended for use online while programming or browsing, while the textbook is best for initial learning and exam review offline.

Uploaded by

GEOVANNI RAMIREZ ORDUNA
Copyright
© © All Rights Reserved
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
25 views

Amazon Pearson Informit

This booksite contains tens of thousands of files that supplement an algorithms textbook. It includes excerpts from the textbook narrative, curated online videos, Java code examples and libraries, selected exercises and solutions, and programming assignments. The textbook itself surveys important algorithms and data structures used today, organized into six chapters covering fundamentals, sorting, searching, graphs, strings, and applications. The booksite is intended for use online while programming or browsing, while the textbook is best for initial learning and exam review offline.

Uploaded by

GEOVANNI RAMIREZ ORDUNA
Copyright
© © All Rights Reserved
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Online content.

 
 This booksite contains tens of thousands of files, fully coordinated with our textbook and also useful as a
stand-alone resource. It consists of the following elements:

•Excerpts. A condensed version of the text narrative, for reference while online.

•Lectures. Curated studio-produced online videos, suitable for remote instruction via CUvids .

•Java code. The algorithms and clients in this textbook, along with the standard libraries they use.

•Exercises. Selected exercises from the book and “web exercises” developed since its publication,
along with solutions to selected exercises.

•Programming assignments. Creative programming assignments that we have used at Princeton.


You can explore these resources via the sidebar at left.

Textbook. 
 The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin
Wayne [ Amazon · Pearson · InformIT ] surveys the most important algorithms and data structures in use
today. We motivate each algorithm that we address by examining its impact on applications to science,
engineering, and industry. The textbook is organized into six chapters:

•Chapter 1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and
making predictions. It also includes our programming model.

•Chapter 2: Sorting considers several classic sorting algorithms, including insertion sort, mergesort,
and quicksort. It also features a binary heap implementation of a priority queue.

•Chapter 3: Searching describes several classic symbol-table implementations, including binary


search trees, red–black trees, and hash tables.

•Chapter 4: Graphs surveys the most important graph-processing problems, including depth-first


search, breadth-first search, minimum spanning trees, and shortest paths.

•Chapter 5: Strings investigates specialized algorithms for string processing, including radix sorting,
substring search, tries, regular expressions, and data compression.

•Chapter 6: Context highlights connections to systems programming, scientific computing,


commercial applications, operations research, and intractability.
Reading a book and surfing the web are two different activities: This booksite is intended for your use while
online (for example, while programming and while browsing the web); the textbook is for your use when
initially learning new material and when reinforcing your understanding of that material (for example, when
reviewing for an exam).

For teachers:

You might also like