Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Volodymyr Chapelev
October 21, 2019
15 hours (approximately)
Volodymyr Chapelev'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
