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