- Computational Thinking
- Algorithms
- Theoretical Computer Science
- Graph Theory
- Probability
- Probability & Statistics
- Data Structures
- Analysis
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Xixuan Wang
June 30, 2019
15 hours (approximately)
Xixuan Wang's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
