I explained that both are divide-and-conquer algorithms. Quick Sort works in-place and is generally faster for smaller datasets but can degrade to O(n²) in the worst case. Merge Sort is stable, consistently O(n log n), and preferred when stability matters or when working with linked lists. I also mentioned practical examples from my projects to show understanding.