- 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 Артем Дмитриевич Митрохин
August 14, 2021
15 hours (approximately)
Артем Дмитриевич Митрохин's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
