class MergeSort{ public static void main(String args[]){ //Mergesort m = new MergeSort(); int size = 10; int mid;

int b=0, e=size-1; int a[] = {3,5,1,7,6,8,2,4,0,9}; sort(a, b, e, size); public void sort(int a[], int beg, int end, int size){ mid = (beg + end)/2; if(beg!=end){ sort(a, beg, mid, size); sort(a, mid+1, end, size); merge(a, b, mid+1, e); } } public void merge(int a[], int b, int mid, int e){ int i=0; int temp[]=new int[size]; while(b<=mid-1 && mid<=e){ if(a[beg]>a[mid]){ temp[i]=a[mid]; mid++; i++; } else{ temp[i]=a[beg]; beg++; i++; } while(b<=mid-1){ temp[i]=a[b]; i++; b++; } while(mid<=e){ temp[i]=a[mid]; i++; mid++; } } }//merge } }