You are on page 1of 2

// Online C compiler to run C program online

#include <stdio.h>
int count =0;
void mergesort(int arr[],int n){
int leftsize=n/2,rightsize=n-leftsize,left[leftsize],right[rightsize];
int merged[n];
if(n<2)
return;
for(int i=0;i<leftsize;i++)
left[i]=arr[i];
for(int j=leftsize;j<n;j++)
right[j-leftsize]=arr[j];

mergesort(left,leftsize);
mergesort(right,rightsize);
merge(left,right,leftsize,rightsize,arr,n,merged);
}
void merge(int left[],int right[],int leftsize,int rightsize,int arr[],int n,int
merged[]){
int i=0,j=0,k=0;
while(i<leftsize&&j<rightsize){
if(left[i]<right[j])
merged[k++]=left[i++];
else
merged[k++]=right[j++];
count++;
}
while(i<leftsize){
merged[k++]=left[i++];
count++;
}
while(j<rightsize){
merged[k++]=right[j++];
count++;
}

for(i=0;i<n;i++)
arr[i]=merged[i];
}
int main(){
int n,arr[10];
while(1){
printf("Enter number\n");
scanf("%d",&n);
printf("Unsorted array=\n");
for(int i=0;i<n;i++)
scanf("%d",&arr[i]);
mergesort(arr,n);
printf("Sorted array=\n");
for(int i=0;i<n;i++)
printf("%d ",arr[i]);
printf("Time complexity=%d\n",count);
count=0;
int i;
for(i=0;i<n-1;i++){
if(arr[i]==arr[i+1]){
printf("Duplicate present\n");
break;
}
if(i==n-1)
printf("Unique Elements\n");
}
}
return 0;
}

You might also like