Notes

#include<stdio.h>
#include<stdlib.h>
#include<time.h>

#include <stdio.h>

void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}

void insertionSort(int arr[], int n)
{
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;

/* Move elements of arr[0..i-1], that are
greater than key, to one position ahead
of their current position */
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}



void rvereseArray(int arr[], int start, int end)
{
int temp;
while (start < end)
{
temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}

int main()
{

int arr[1000000];
clock_t t1,t2,t3;

for(int j=10000;j<1000000;j=j*5)
{

for(int i=0;i<j;i++){
arr[i] = rand()%100;
}
t1 = clock();
int n = sizeof(arr)/sizeof(arr[0]);
insertionSort(arr, n);

t1 = clock() - t1;
double time_taken1 = ((double)t1)/CLOCKS_PER_SEC; // in seconds

printf("average case for %d input took %f seconds to execute n",j, time_taken1);



t2= clock();

insertionSort(arr, n);
t2 = clock() - t2;
double time_taken2 = ((double)t2)/CLOCKS_PER_SEC; // in seconds

printf("best case for %d input took %f seconds to execute n", j,time_taken2);


rvereseArray(arr, 0, n-1);
t3= clock();

insertionSort(arr, n);
t3 = clock() - t3;
double time_taken3 = ((double)t3)/CLOCKS_PER_SEC; // in seconds

printf("worst case for %d input took %f seconds to execute n",j, time_taken3);

}
return 0;
}