16 April 2011

Robert Sedgewick’s Algorithm Lectures

Hello programmers, Today I would like to give you the links of  Robert Sedgewick’s Algorithm Lectures. Robert Sedgewick works in the Department of Computer Science, Princeton University, Princeton, NJ 08544

Below are links to the lecture slides. This list is tentative and is to be considered subject to change. Minor updates are possible at any time. Substantive updates (not unlikely the evening before a lecture) will be marked with the date of change. Here are the reported errata.

LECTURE SLIDES DEMOS
Intro · Union find
Analysis of algorithms
Stacks and queues (new 2/7)
Elementary sorts sorting animations
Mergesort sorting animations
Quicksort
Priority queues
Symbol tables · BSTs
Balanced search trees
Hash tables · Applications
Undirected graphs (new 3/10) DFS BFS maze
Directed graphs (fixed 3/23) DFS topological sort
Minimum spanning trees (new 3/23) Graph applet
Shortest paths (new 3/28) Dijkstra
Radix sorts string sorting
Tries
Data compression
Substring search substring search
Regular expressions
Geometric primitives convex hull Voronoi
Geometric search·Intersection sweep line intersection
Reductions·Intractability
Combinatorial search The Longest Path [mp3]

This file with all the slides for Lectures 1-10 (28 MB) is suitable for uploading to a portable device, as is this file with all the slides for Lectures 12-24 (40 MB) and this file with all the slides for the course (66 MB). These files do not reflect changes made as the semester progresses

You may have missed:

Comments are closed.