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