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

