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