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