Regarding merge sort

#1

here why u have taken mid+1 instead of mid

#2

this is how our merge sort is working
image

follow the numbers in green to trace the flow of program

#3

but if we do mid+1 what is theactual position we get can u tell ?

#4

if take s+e/2 then suppose if there are 5 elements ,then which one will be mid 2 or 3?

#5

mid will be 2 for n=5 coz we take ans in int form here so 5/2 =2 and therefore we need to take 1st array till 2 and then start next from the 3rd element (m+1)

#6

for storing the element to orignal array why we have taken i inside temp we have stored in temp[k] ?

#7

and in main function why u have passed 0 in(a,0,n-1) …

#8

Array is taken from 0 to position n-1 so we passed 0 and n-1

#9

can you elaborate your doubt

#10
#11

can u tell me whats the error .

#12

here is your corrected code:


i have marked the mistakes

if this solves your doubt please mark it as resolved :slight_smile: