Respuesta :

Martebi

The point at left and right partition position to add 21 is Left position is 1 and right position is 7.

How do you solve merge sort?

The Algorithm for Merge Sort operations are:

  • First one need to find the middle index of the array.
  • Then one has to Divide the array from the middle.
  • Then do Call merge sort for the second half of the array.
  • Then one can finally merge two sorted halves into one sorted array.

Hence, The point at left and right partition position to add 21 is Left position is 1 and right position is 7.

See Group of answer choices

Left position is 2 and right position is 6

Left position is 1 and right position is 7

Left position is 4 and right position is 7

Left position is 2 and right position is 5

Learn more about sort operation from

https://brainly.com/question/15090822

#SPJ1

Otras preguntas