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