- Graph Theory
- Probability
- Algorithms
- Theoretical Computer Science
- Computer Science
- Computational Thinking
- Data Structures
- Analysis
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Michael Winn
February 4, 2021
15 hours (approximately)
Michael Winn's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
