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