Thread: MERGE SORT pls help

this is correct already i just nid to display the part by part of merge sort steps

 
public class mergesortinteger {
 
 
 
  public static int a[]=new int[50];
 
  public static void merge_sort(int low,int high)
{
 int mid;
 if(low<high)
 {
  mid=(low+high)/2;
  merge_sort(low,mid);
  merge_sort(mid+1,high);
  merge(low,mid,high);
 }
}
  public static void merge(int low,int mid,int high)
{
 
 int h,i,j,k;
 int b[]=new int[50];
 h=low;
 i=low;
 j=mid+1;
 while((h<=mid)&&(j<=high))
 {
  if(a[h]<=a[j])
  {
   b[i]=a[h];
   h++;
  }
  else
  {
   b[i]=a[j];
   j++;
  }
  i++;
 }
 if(h>mid)
 {
  for(k=j;k<=high;k++)
  {
   b[i]=a[k];
   i++;
  }
 }
 else
 {
  for(k=h;k<=mid;k++)
  {
   b[i]=a[k];
   i++;
  }
 }
 for(k=low;k<=high;k++) a[k]=b[k];
}
 
 
    public static void merge_integer(){
 
    int num,i;
 
 System.out.println("N series");
 num=new Scanner(System.in).nextInt();
 System.out.println();
 System.out.println("Now, Please Enter ("+ num +") nos.:");
 for(i=1;i<=num;i++)
 {
  a[i]=new Scanner(System.in).nextInt() ;
 }
 
 merge_sort(1,num);
 System.out.println();
 System.out.println("Merge Sorted[Integer]:");
 for(i=1;i<=num;i++)
     System.out.println(a[i]+"    ");
 
 
    }
 
}

edited .... how will i display the sorting .....

example :

N series: 8
Input Value:
5
7
4
3
2
8
6
1
 
DISPLAY :   
             5 7 4 3 2 8 6 1
            5 7 4 3   2 8 6 1
           5 7   4 3   2 8   6 1
         5  7  4  3    2  8  6  1 
         5 7   3 4      2 8   1 6
          3 4 5 7        1 2 6 8
             1 2 3 4 5 6 7 8 <-----FINAL answer

--- Update ---

the spaces in the display doesnt matter

my program only display the sorted array ...not displaying the step by step sorting of a merge sort