Help needed in mergesort

hello my friend coders,can anybody please tell me whats wrong with my implementations .Thank you

intitially you need to divide the complete array then you have to copy values based on comparision
link:http://ideone.com/XR9S0e

thanks a lot…but it would be best if you can tell me what’s wrong with my code.thanks in advance

i think there is small mistake but just can’t find it

in your code, the statement int n=sizeof(a)/sizeof(a[0])-1; gives incorrect size of array

thank you…but then what int n=sizeof(a)/sizeof(a[0]); still the same

int n=sizeof(a)/sizeof(a[0])-1; will work only iff you are dealing with arrays not received as parameters.so, you better pass another parameter such as low and high to determine the segment of original array