#include int a[100],n; void create() { int i; printf("Enter the size of the array elements : "); scanf("%d",&n); printf("Enter the elements of the array : "); for(i = 0; i < n; i++) scanf("%d",&a[i]); } void display() { int i; printf("The array elements are : "); for(i = 0; i < n; i++) printf("%d ",a[i]); printf("\n"); } void insert() { int pos,num,i; printf("Enter the position(index) for the new element : "); scanf("%d",&pos); printf("Enter the element to be inserted : "); scanf("%d",&num); if(pos > n) printf("Invalid position.\n"); else { for(i = n; i >= pos; i--) { a[i+1] = a[i]; } a[pos] = num; n++; } } void delete() { int pos,i; printf("Enter the position(index) of the element to be deleted : "); scanf("%d",&pos); if(pos > n) printf("Invalid position.\n"); else { for(i = pos; i < n; i++) { a[i] = a[i+1]; } n--; } } void secondMax() { int max1,max2,i; max1 = max2 = -2147483648; for(i = 0;i < n;i++) { if(a[i] > max1) { max2 = max1; max1 = a[i]; } else if(a[i] > max2 && a[i] < max1) max2 = a[i]; } //printf("First largest = %d\n", max1); printf("Second largest = %d\n", max2); } void positiveSquare() { int sum = 0,i; for(i = 0; i < n; i++) sum += (a[i] * a[i]); printf("Sum is : %d\n",sum); } void sortFreq() {//THIS FUNCTION IS NOT WORKING int b[100],c[100],i,j; for(i = 0 ; i < n ; i++) { b[i] = a[i]; c[i] = a[i]; } for(i = 0; i < n-1; i++) for(j = i+1; j < n; j++ ) if(b[i] < b[j]) { int temp = b[i]; b[i] = b[j]; b[j] = temp; } for(int j = 0 ; j < n ; ++j){ if(b[j]!=0){ for(int i = 0 ; i < n ; ++i){ if(b[j] == c[i]){ for(int k = 0 ; k < b[j] ; ++k) printf("%d ",i); c[i] = 0; } } } } printf("\n"); } void missing() { int i,j,arr[100],temp,flag,min,max; min=max=a[0]; for(i=1; ia[i]) min=a[i]; if(max

arrayoperations.c