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