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