Also known as algs4 and Princeton COS 226, Algorithms on Coursera is an introductory course to fundamental data types, algorithms, and data structures, divided into two Parts.
-
Part I focuses on elementary data structures, sorting, and searching. Topics 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 kd-trees.
-
Part II focuses on graph and string-processing algorithms. Topics 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 Burrows−Wheeler transform. Part II also introduces reductions and intractability, including the P = NP problem.
I've compacted all the related slides into a pdf file, and added outlines (bookmarks, navigation trees, table of contents) for referencing. Available at iCloud Drive (1584 pages, 160 MB).
- Percolation ✅ 💻 💯 - Union-Find
- Deque and RandomizedQueue ✅ 💻 💯 - Stack and Queue
- Collinear Points ✅ 💻 💯 - Sorting
- 8 Puzzle ✅ 💻 💯 - PriorityQueue
- KdTree ✅ 💻 💯 - SearchTree
- WordNet ✅ 💻 💯 - DirectedGraph
- Seam Carving ✅ 💻 💯 - Shortest Path
- Baseball Elimination ✅ 💻 💯 - MaxFlow
- Boggle ✅ 💻 💯 - Trie
- Burrows-Wheeler ✅ 💻 💯 - Data Compression
- Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne, Addison-Wesley Professional, 2011, ISBN 0-321-57351-X.
The algs4 booksite is open to everyone and contains a wealth of supplementary information, including synopses of the textbook and Java code that you will be using throughout the course.