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