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