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