___________ is a divide and conquer sorting algorithm.

  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Selection Sort
Merge sort is a classic example of a divide and conquer algorithm, where the sorting process involves dividing the array into smaller subarrays, sorting them individually, and then merging them back together in sorted order.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *