Hello I need help with modifying my code. Can you please edit where I would be able to get the average run time for each of my algorithms so that I can plot it? Based off of this formula. I will place my code under this photo

My code:

#include

#include #include #include #include

void insertionSort(int arr[], int n) { int i, j; int temp; for (i = 1; i 0 && arr[j] > temp) { arr[j + 1] = arr[j]; j = j - 1; } arr[j + 1] = temp; } }

void heapify(int arr[], int n, int i) { int largest = i; int l = 2 * i + 1; int r = 2 * i + 2;

if (l arr[largest]) largest = l;

if (r arr[largest]) largest = r;

if (largest != i) { int temp = arr[i]; arr[i] = arr[largest]; arr[largest] = temp;

heapify(arr, n, largest); } }

void heapSort(int arr[], int n) { int i = 0; for (i = n; i >= 0; i--) heapify(arr, n, i);

for (i = n; i > 0; i--) { int temp = arr[0]; arr[0] = arr[i]; arr[i] = temp; heapify(arr, i, 0); } }

int partition(int arr[], int low, int high) { int pivot = arr[high]; int i = (low - 1), j;

for (j = low; j

void quickSort(int arr[], int low, int high) { if (low

int main() { srand(time(NULL)); int ns = 1000, nf = 200000, m = 10, d = 1000, i, j, k; printf("times in micro seconds "); printf("n\tInsertion Sort\t Heap Sort\t Quick Sort "); long ins_time, heap_time, quick_time; for(i=ns; i

for(j=1; j

for(j=1; j

printf("%d\t\t%ld\t\t%ld\t\t%ld ",i, ins_time, heap_time, quick_time); }

return 0; }

averan 15