The ____ sort algorithm repeatedly divides the list into two halves until each sub-list contains a single element.

  • Bubble
  • Insertion
  • Merge
  • Quick
The Merge Sort algorithm repeatedly divides the list into two halves until each sub-list contains a single element and then merges them back together in a sorted manner. It is known for its stable and efficient sorting.
Add your answer
Loading...

Leave a comment

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