| Algorithm | Divide Step | Conquer Step | Combine Step | Time Complexity |
|---|
| Merge Sort | Split array into halves | Recursively sort each half | Merge sorted halves | O(n log n) |
| Quick Sort | Partition array around a pivot | Recursively sort left and right | No additional work needed | O(n log n) avg, O(n^2) worst |
| Binary Search | Find middle element | Recursively search left or right half | Directly return result | O(log n) |
| Median Finding | Divide into groups of 5 | Find median of medians | Use median for selection | O(n) |
| Matrix Multiplication | Partition matrix into quadrants | Compute seven matrix products | Reconstruct final matrix | O(n^{2.81}) (Strassen’s) |
