Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Artem Katashev
October 22, 2017
15 hours (approximately)
Artem Katashev'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: Probability & Statistics
- Category: Graph Theory
- Category: Algorithms
- Category: Analysis
- Category: Theoretical Computer Science
- Category: Probability
- Category: Design Strategies
- Category: Computer Science
- Category: Data Structures
- Category: Computational Thinking
