- 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 Daniel Stanojevic
March 22, 2021
15 hours (approximately)
Daniel Stanojevic's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
