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