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