- 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 Nima Azarbayjani
August 10, 2021
15 hours (approximately)
Nima Azarbayjani's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
