Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Adam Labi
December 2, 2019
15 hours (approximately)
Adam Labi'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: Logical Reasoning
- Category: Theoretical Computer Science
- Category: Mathematical Theory & Analysis
- Category: Probability & Statistics
- Category: Algorithms
- Category: Data Structures
- Category: Design Strategies
- Category: Computational Thinking
- Category: Probability
- Category: Analysis
