Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Xinyi Ouyang
December 17, 2018
15 hours (approximately)
Xinyi Ouyang's account is verified. Coursera certifies their successful completion of Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Skills you will gain
- Category: Graph Theory
- Category: Probability
- Category: Design Strategies
- Category: Mathematical Theory & Analysis
- Category: Probability & Statistics
- Category: Algorithms
- Category: Logical Reasoning
- Category: Theoretical Computer Science
- Category: Data Structures
- Category: Computational Thinking
- Category: Analysis
