Question

this is my program to list the number of inversions and print them, i think everything about the code is ok
but smthin s wrong it doesnt work....can any1 please check code for me?

Answer 1

@mattfeury

Answer 2

@infinity_
@NeThWa
@ktobah

Answer 3

my final code
please check this
it gives some random out put

Answer 4

you know, there is no need to implement merge sort every time you need to sort something :P.Try using standard functions which sort and then count the inversions.

Answer 5

I can't understand your code sorry, but I'm sure you are having a problem with the pointers.

Answer 6

I didn't study your code thoroughly, but a few things stand out to me. In mergesort:
mid=(high+low)/2;
can cause integer overflows. It's been changed to:
mid = ( high - low ) / 2 + low;

In list, I'm surprised that ptr1 and ptr2 aren't int*.

Comments in the code would help a lot.

Answer 7

ptr are to get the index of the array.... they are not pointers....mid wud give the same value in both the cases...
nd i was trying to implement this in O(nlogn)
thanks all for your time :)

Answer 8

Is your code running now?

Answer 9

it is running but it doesnt give the req out put

Answer 10

Now start debugging if you dare... with a code like that, nobody can debug.When you try solving suck a simple problem don't try using the most sophisticated stuff you know.I'ts ridiculous :P,It's such an easy problem.

Answer 11

such *

Answer 12

m trying to debug it............

Answer 13

actually that's the problem...it's such a simple problem but i cant get it right......
if i wonder if i can copy the code everytime......

Answer 14

@infinity_
i changed the code and this one's a lot better but ther's still a bug in somewer i just cant figure it out..... can u please take a look at it?

Answer 15

why so complicated? use stl sort.. it is so easily used and it can save you 20 lines of codde

Answer 16

stl?

Answer 17

I can't figure it too, but now I think there is a problem in the print function or when you called it inside your program, try to revise this part.

Answer 18

there are some function which sort.. you don't need to write everything you might need.

Answer 19

i got this question covered but i still wonder where i went wrong in that file........

Answer 20

thank you alll