- Computational Thinking
- Probability
- Algorithms
- Analysis
- Computer Science
- Data Structures
- Theoretical Computer Science
- Graph Theory
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Wan Ying Ng
November 7, 2021
15 hours (approximately)
Wan Ying Ng's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
