How does merge sort divide and conquer a given list/array?

  • It multiplies each element by a random factor
  • It randomly splits the list into parts
  • It recursively divides the list into halves, sorts each half, and then merges them back together.
  • It selects the smallest element and moves it to the beginning
Merge sort divides a given list or array by recursively breaking it into halves until individual elements. Then, it sorts each segment and merges them back together to construct a sorted array.
Add your answer
Loading...

Leave a comment

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