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