Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Thomas Hogan
November 15, 2016
15 hours (approximately)
Thomas Hogan'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: Design Strategies
- Category: Theoretical Computer Science
- Category: Algorithms
- Category: Mathematical Theory & Analysis
- Category: Probability & Statistics
- Category: Logical Reasoning
- Category: Data Structures
- Category: Probability
- Category: Graph Theory
- Category: Analysis
