-
Notifications
You must be signed in to change notification settings - Fork 2
/
mergesort.java
64 lines (64 loc) · 1.42 KB
/
mergesort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
import java.util.*;
public class mergesort
{
static int max=50000;
public static void merge(int a[],int low,int mid,int high)
{
int i=low;
int j=mid+1;
int k=low;
int c[]=new int[20000];
while((i<=mid)&&(j<=high))
{
if(a[i]<=a[j])
c[k]=a[i++];
else
c[k]=a[j++];
k++;
}
while(i<=mid)
c[k++]=a[i++];
while(j<=high)
c[k++]=a[j++];
for(i=low;i<=high;i++)
a[i]=c[i];
}
public static void ms(int a[],int low,int high)
{
if(low<high)
{
int mid=(low+high)/2;
ms(a,low,mid);
ms(a,mid+1,high);
merge(a,low,mid,high);
}
}
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
System.out.println("Enter the number of elements : ");
int n=s.nextInt();
Random r=new Random();
int arr[]=new int[max];
try
{
for(int i=0;i<n;i++)
arr[i]=r.nextInt(100);
System.out.println("The random elements are : ");
for(int i=0;i<n;i++)
System.out.print(arr[i]+" ");
long start_time=System.nanoTime();
ms(arr,0,n-1);
long end_time=System.nanoTime();
long total_time=end_time-start_time;
System.out.println("\nElements after sorting : ");
for(int i=0;i<n;i++)
System.out.print(arr[i]+" ");
System.out.println("\nExecution time : "+total_time+" nanoseconds");
}
catch(ArrayIndexOutOfBoundsException ae)
{
System.out.println("Array Index reached maximum");
}
}
}