Algorithms, part 1, Tim Roughgarden, Stanford, Coursera

This is the syllabus of part I.

• Introduction
• Asymptotic analysis
• Divide and conquer algorithms
• The master method
• Quicksort
• Quicksort-analysis
• Probability review
• Linear-time selection
• Graphs and the contraction algorithm
• Graph search
• Dijkstra shortest path algorithm
• Data structures

Algorithms, parts I and II, Robert Sedgewick and Kevin Wayne, Coursera, Princeton

This is the syllabus, to compare with the two Tim Roughgarden's Coursera Algorithms courses (now a specialization in 4 parts).
For part I:

• Week 1: union-find and analysis of algorithms.
• Week 2: Stacks and queues, and elementary sorts.
• Week 3: Merge sort and quick sort.
• Week 4: Priority queues, elementary symbol tables and binary search trees.
• Week 5: Balanced search trees and geometric search.
• Week 6: Hash tables and searching applications.

For part II:

• Week 1: Undirected graphs and directed graphs
• Week 2: Minimum spanning trees and shortest paths
• Week 3: Maximum flow and radix sorts
• Week 4: rest
• Week 5: Tries and substring search 
• Week 6: Regular expressions and data compression
• Week 7: Reductions, linear programming and intractability