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