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