Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Pavel Melyanets
January 29, 2020
15 hours (approximately)
Pavel Melyanets'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: Algorithms
- Category: Logical Reasoning
- Category: Design Strategies
- Category: Theoretical Computer Science
- Category: Data Structures
- Category: Probability
- Category: Graph Theory
- Category: Computational Thinking
- Category: Analysis
- Category: Probability & Statistics
