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