Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Completed by Pham Hoang Le Nguyen
August 2, 2024
15 hours (approximately)
Pham Hoang Le Nguyen'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: Design Strategies
- Category: Logical Reasoning
- Category: Theoretical Computer Science
- Category: Data Structures
- Category: Probability & Statistics
- Category: Mathematical Theory & Analysis
- Category: Algorithms
- Category: Probability
- Category: Analysis
- Category: Graph Theory
