- 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 Luca Fedeli
May 8, 2020
15 hours (approximately)
Luca Fedeli's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
