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