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