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