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