datastructure2

///Home Work 2 @Nurnobi shanto
#include<stdio.h>
int main(){
    int n, i, l1 = 0, l2 = 0, s1 = 0, s2 = 0,j=0,k=0,t=0;
    printf("How many Numbers You want to insert..?\n");
    scanf("%d", &n);
    int a[n+1],arr[n];
    printf("Enter %d array elements\n", n);
    for(i = 0; i < n; i++){
        scanf("%d", &a[i]);

    }
///let for main value ;
    l1=a[0];
    s1=a[0];

///code for First largest & smallest value;
    for(i = 1; i < n; i++){
        if(a[i] > l1)
           {
              l1 = a[i];
              j=i;
           }

        if(a[i] < s1)
           {
              s1 = a[i];
              k=i;
           }

        }
///code for delete  largest & smallest value;

for(i=0,t=0;i<n;i++)
{
    if(i==j||i==k)
       {continue;}
   else {arr[t]=a[i];
  t++;
}
}
///let for 2nd main value;
    l2=arr[0];
    s2=arr[0];

///code for 2nd largest & smallest value;
    for(i = 1; i < t; i++){
        if(arr[i] > l2)
           {
              l2 = arr[i];
           }

        if(arr[i] < s2)
           {
              s2 = arr[i];
           }

        }
printf("\nSecond Large value=%d\nSecond small Value=%d\n",l2,s2);
    return 0;
}