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