Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Shu-Hsiang Liang
January 15, 2026
15 hours (approximately)
Shu-Hsiang Liang's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
- Category: Computational Thinking
- Category: Design Strategies
- Category: Analysis
- Category: Logical Reasoning
- Category: Mathematical Theory & Analysis
- Category: Probability & Statistics
- Category: Algorithms
- Category: Probability
- Category: Graph Theory
- Category: Theoretical Computer Science
- Category: Data Structures
