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