Csddaa

Week 1:  #include<stdio.h> int max,min; int a[100]; void maxmin(int i,int j) { int max1,min1,mid; if(i==j) { min=max=a[i]; } else { if(i==j-1) { if(a[i]<a[j]) { max=a[i]; min=a[j]; } else { max=a[i]; min=a[j]; } } else { mid=(i+j)/2; maxmin(i,mid); max1=max; min1=min; maxmin(mid+1,j); if(max<max1) max=max1; if(min>min1) min=min1; } } } int main() { int i,n; printf("Enter no of keys\n"); scanf("%d",&n); printf("Enter the keys:\n"); for(int i=1;i<=n;i++) scanf("%d",&a[i]); max=a[1]; min=a[1]; maxmin(1,n); printf("Minimum element in the array is:%d\n",min); printf("Maximum element in the array is:%d\n",max); return 0; } Week 2: #include<stdio.h> #include<stdlib.h> void merge(int arr[],int l,int m,int r) { int i,j,k; int n1=m-l+1; int n2=r-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[...