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