The code can be found here: http://pastebin.com/f7f49e556

I translated from a Java source, at the moment I can't find it, but if
I do I'll post it.

What my problems actually are is that, when run, the array is not in
the correct order... At the beggining, there may be a clump of
numbers, not in order, usually followed by large spaces of zeros and
maybe a few numbers

r030t1@gmail.com wrote:

Mergesort is a pretty basic algorithm. It shouldn't need translating
from other languages.

If you ever find the Java code, take another look at it. Does it have
something like this:

int i = 0;
int j = lo;
while (j <= med) {
B[i++] := A[j++];
}

I suspect it does. You've translated it wrong. Those are
*post*-increment operators. They evaluate to the *current* value of i
and j, not the incremented values. The first index assigned in B is 0,
not 1.

Now look at your code.