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