Implementation of mergesort in Java
You don't have to distinguish if array.length if even or odd.
Just do:

    int[] right = new int[array.length/2];
    int[] left = new int[array.length - array.length/2];


It will make the two tables to have exactly array.length items together, divided by half as precisely as possible.