(Solved): Study the code of insertion sort and selection sort and beefily explain why on average, insertion so ...

Study the code of insertion sort and selection sort and beefily explain why on average, insertion sort is faster than selection sort by a constant factor.

???????

6. Write a program to sort an array using insertion sort algorithm. \#include ?conio.h? \#define size 5 void insertion_sort(int arr[], int $n$ ); void main() f int $\mathrm{arr}[$ size], i, $n$; printf("\n Enter the number of elements in the array: "); scanf(-Yd", \&n); printf(" $\backslash$ n Enter the elements of the array: "); for $(i=?;i<n;i++)$ i scanf("\%d", \&arr[i]); \} insertion_sort (arr, n); printf(" $\backslash \stackrel{?}{n}$ The sorted array is: $\backslash n^{?})$; for $(i=0;i<n;i++)$ printf(- $\%d\backslash t^{?}$, arr[i]); getch(); \} void insertion_sort(int $\mathrm{arr}[]$, int $n$ ) f int $i,j$, temp; for $(i=1;i<n;i++)$ \& temp $=\mathrm{arr}[i]$ $j=i?1;$ while $(($ temp $<\mathrm{arr}[j])\&\&(j>=0))$ \{ $\mathrm{arr}[j+1]=\mathrm{arr}[j];$ $j??j$ \} $\mathrm{arr}[j+1]=$ temp; \} 3 Output Enter the number of elements in the array : 5 Enter the elements of the array : 5001502376 The sorted array is: 7. Write a program to sort an array using selection sort algorithm. int smallest(int arr[], int $k$, int $n$ ); void selection_sort(int arr[], int $n$ ); void main(int argc, char *argv[]) \{ int $\mathrm{arr}[10],i,n$; printf("\n Enter the number of elements in the array: "); $\mathrm{scanf}\left(?\%d^{?},\&n\right)$; printf("\n Enter the elements of the array: "); for $(i=0;i<n;i++)$ \{ scanf("\%d", $\mathrm{sarr}[i]);$ \} selection_sort $(\mathrm{arr}r,n)$; printf( $\backslash$ n The sorted array is: $\backslash n^{??})$; for $(i=0;i<n;i++)$ printf(" \%d\t", $\mathrm{arr}[i])$; 3 int smallest(int arr[], int $k$, int $n$ ) f int pos $=k$, sma1l=arr $[k],i$; for $(i=k+1;i<n;i++)$ \{ if(arr $[i]<sma11)$ \{ $sma11=\mathrm{arr}[i]$ pos $=i;$ 3 return pos; 3 void selection_sort (int arr[], int $n$ ) \{ int $k$, pos, temp; for $(k=0;k<n;k++)$ \{ pos $=\mathrm{smallest}(\mathrm{arr},k,n)$ temp $=\mathrm{arr}[k]$