Lab Assignment-3

Name: Snehith Challa

ID: 1410110419

Code:
#include <stdio.h>
#include <time.h>

void radixsort(int arr[], int n);

void mergeSort(int arr[], int l, int n);
void bubbleSort(int arr[], int n);

int main(){

clock_t start1,end1,start2,end2,start3,end3;
double total[3];
int i=0;
int n = 100;
int arr[n],arr1[n],arr2[n],arr3[n];
for(i=0;i<n;i++){
arr[i] =rand();
arr1[i] = arr2[i] = arr3[i] = arr[i];
}

for (i = 0; i < 3; ++i)

{
/* code */
total[i] = 0;
}
start1 = clock();
 radixsort(arr1,n);
end1 = clock();
start2 = clock();
bubbleSort(arr2,n);
end2= clock();
start3 = clock();
mergeSort(arr3,0,n-1);
end3= clock();

total[0] = (double)(end1 - start1) / CLOCKS_PER_SEC;

total[1] = (double)(end2 - start2) / CLOCKS_PER_SEC;
total[2] = (double)(end3 - start3) / CLOCKS_PER_SEC;

printf("radixsort time = %f\n",total[0]);

printf("bubblesort time = %f\n",total[1]);
printf("mergesort time = %f\n",total[2]);

void radixsort(int arr[], int n)

{
int max = largerN(arr, n);
int exp =0;
for (exp = 1; max/exp > 0; exp *= 10){
int output[n];
int i, count[10] = {0};

for (i = 0; i < n; i++)

count[ (arr[i]/exp)%10 ]++;

for (i = 1; i < 10; i++)

count[i] += count[i - 1];
 for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
}
void swap(int *x, int *y)
{
int temp = *x;
*x = *y;
*y = temp;
}
void bubbleSort(int arr[], int n)
{

int i, j;
for (i = 0; i < n-1; i++){
for (j = 0; j < n-i-1; j++){
if (arr[j] > arr[j+1]){
swap(&arr[j], &arr[j+1]);
}
}
}

void mergeSort(int arr[], int l, int n)

{

if (l< n){
 int m=l+(n-l)/2;
mergeSort(arr,l,m);
mergeSort(arr,m+1,n);
int i, j,k;
int n1 = m- l + 1;
int n2 = n- m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l+ i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2){
if (L[i] <= R[j]){
arr[k] = L[i];
i++;
}
else{
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1){
arr[k] = L[i];
i++;
k++;
}

while (j < n2){

arr[k] = R[j];
 j++;
k++;
}
}

int largerN(int arr[],int n)

{
int max = arr[0];
int i=0;
for (i = 1; i < n; i++){
if (arr[i] > max)
max = arr[i];
}
return max;
}

Results:
Algorithm Execution Time Execution Time Execution Time
(10^3) (10^6) (10^9)
Bubble Sort 0.000035s 0.000036s 0.000043s
Radix Sort 0.000019s 0.000019s 0.000024s
Merge Sort 0.000013s 0.000014s 0.000016s