Inversion count problem?

#1

in the implementation of the code.
int x=…
int y=…
int z=…

here x and y will always be zero right ?

#2

hello @mehulbhandari358
can u please share the code snippet that u are talking about.

if u r just declaring variable.
then output will depend on compiler.
in some compiler it will give 0.
and in some it will give garbage value

#3

the code is in the video

#4

also we need to sort the two divided sort before merging but it’s not done here ?

#5

no x ,y will not be zero.

it will contain the value that is returned by inversion count function

no we r calling merge function in the last.
that will merge those two sorted array.

#6

i got it . can you please give me a tree explanation for better understanding .

#7

it will be exaclty same as merge sort tree .

#8

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.