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