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