Divide-and-Conquer Algorithms
Master of Engineering (MEng) · University · Computer Science
This unit introduces divide-and-conquer algorithms, including merge sort, quick sort, and binary search. Students will learn how to analyze the time complexity of these algorithms and solve recurrence relations.
What's included
- Divide-and-Conquer Paradigm
- Merge Sort
- Quick Sort
- Binary Search
- Time Complexity Analysis
- Recurrence Relations
- Applications of Divide-and-Conquer Algorithms
Keywords
- Divide-and-Conquer
- Time Complexity
- Algorithm Analysis