mergeSort

[Blue_beaver]

in class, the teacher showed us the mergeSort recursive algorithm.

I tried to implement it, but for some reasons, it erases the array somehow.

The way i implemented it was to create a class Sortable and methods that i could use on a Sortable object like this:
____
int[] test = new int[] {3,1,2};
Sortable = new Sortable(test);
test.mergeSort;
_____

Here's my code:

java
.pastebin.
com/
m77def8af

Here's the algorithm in pseudo code:

freepdfhosting.
com/
db1d6d7d61.pdf

HELP! ;_;

[CodesAway]

You didn't implement the psudocode exactly. Check your merge function against the psudocode, line by line, your mistake lies there.

A hint, did you know that uninitialized values in an int array are set to zero? What happened isn't that your array was erased, but instead you copied a bunch of zero values over the correct values. So, where in your code did you copy values from an uninitialized array? And, did you mean to copy all the values that you copied?

[Blue_beaver]

Thank you so much for this perfect answer: the hint was EXACTLY what i was missing.

Thank you so much again. :D