Problem in MergeSort i need it in 1 Hour :-(

Question

Hallo,
im trying to implement a Mergesort with test methode but the problem i can not start the code, i need help to solve this problem, that would be perfekt if i get that in 1 hour, i have to give the Answer to my Teacher!
hier ist my code:
public class MergeS
static void msort (int[] array, int le, int ri)
int i, j, k;
int [] b = new int [array.length];
if (ri > le) {
  // zu sortierendes Feld teilen
  int mitte = (ri + le) / 2;
  // teilfelder sortieren
  msort (array, le, mitte);
  msort (array, mitte + 1, ri);
  //Hilfsfeld aufbauen
  for (k = le; k <= mitte; k++)
    b[k] = array[k];
  for (k = mitte; k < ri; k++)
    b[ri + mitte - k] = array[k+1];
  // Ergebnisse mischen ?ber Hilfsfeld b
  i = le;
  j = ri;
  for (k = le; k <= ri; k++)
    if(b[i] < b[j])
      array[k] = b[i++];
    else
      array[k] = b[i--];
static void mergeSort (int[] array) {
  msort(array, 0, array.length - 1);
public static void main(String[] args)
int i;
int [] a;
int idx = AdvancedIO.readInt();
System.out.println("the Number of the Elements in the Array: " +idx);
a = new int[idx];
for (i = 0; i <= idx - 1; i++){
a = AdvancedIO.readInt();
System.out.println("Element with Index" + i + "Enter: " + a [i]);
SortierenA sArray = new SortierenA();
sArray.mergeSort(a);
System.out.print ("the Sorted Array is: " );
for (i=0; i <= idx -1; i++){
System.out.print (a[i]);
thank u very much!

Answer 1

the problem is solved, and about the merge part its was incorrect, thank u very much, owith out ur help, i could never find my mistake, hier ist the correct code:
public class MergeS
static void msort (int[] array, int le, int ri)
int i, j, k;
int [] b = new int [array.length];
if (ri > le) {
  // zu sortierendes Feld teilen
  int mitte = (ri + le) / 2;
  // teilfelder sortieren
  msort (array, le, mitte);
  msort (array, mitte + 1, ri);
  //Hilfsfeld aufbauen
  for (k = le; k <= mitte; k++)
    b[k] = array[k];
  for (k = mitte; k < ri; k++)
    b[ri + mitte - k] = array[k+1];
  // Ergebnisse mischen ?ber Hilfsfeld b
  i = le;
  j = ri;
  for (k = le; k <= ri; k++)
    if(b[i] < b[j])
      array[k] = b[i++];
    else
      array[k] = b[j--];
static void mergeSort (int[] array) {
  msort(array, 0, array.length - 1);
public static void main(String[] args)
int i;
int [] a;
System.out.println("the Number of the Elements in the Array: " );
int idx = AdvancedIO.readInt();
//System.out.println(idx);
a = new int[idx];
for (i = 0; i <= idx - 1; i++){
   System.out.println("the Element with Index - " + i + " should be ");
    a = AdvancedIO.readInt();
//System.out.println(a[i]);
MergeS sArray = new MergeS();
sArray.mergeSort(a);
System.out.print ("the Sorted Array is: " );
for (i=0; i <= idx -1; i++){
System.out.print (a[i]);