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