DAA 3
MargeSort pgm package demo;
import java.util.Scanner;
public class MergeSort {
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[];
Scanner scan=new Scanner(System.in);
System.out.println("Enter the size for merge sort...:");
int n=scan.nextInt();
a=new int[n];
System.out.println("enter array elements:");
for(int i=0;i<n;i++)
a[i]=scan.nextInt();
msortdiv(a,0,n-1);
System.out.println("sorted array are:");
for(int i=0;i<n;i++)
System.out.println(a[i]+" ");
}
static void msortdiv(int a[],int low,int high)
{
int mid;
if(low<high)
{
mid=(low+high)/2;
msortdiv(a,low,mid);
msortdiv(a,mid+1,high);
mergesort(a,low,mid,high);
}
}
static void mergesort(int a[],int low,int mid,int high)
{
int i,j,k,b[]=new int[20];
i=low;
j=mid+1;
k=low;
while(i<=mid && j<=high)
{ if(a[i]>=a[j])
{
b[k]=a[j];
j++;
k++;
}
else
{
b[k]=a[i];
k++;
i++;
}
}
while(i<=mid)
...