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