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