Divide-and-Conquer Algorithms
Master of Science (MSc) · University · Computer Science
This unit introduces divide-and-conquer algorithms, such as merge sort and quick sort, and their analysis. Students will learn the principles of divide-and-conquer and apply them to solve various algorithmic problems.
What's included
- Divide-and-Conquer Paradigm
- Merge Sort
- Quick Sort
- Recurrence Relations
- Asymptotic Analysis
- Algorithm Design
- Time Complexity
- Space Complexity
- Applications of Divide-and-Conquer
Keywords
- Divide-and-Conquer