WAP to find the largest and second largest element in an array.

Here is your code in C -



#include <stdio.h>


int main() {

    int a[6], i, l1, l2;
    
    printf ("Enter the elements of array: ");
    
    for (i=0; i<6; i++) {
        scanf("%d", &a[i]);
    }
    
    l1 = a[0];
    
    l2= a[0];
    
    for (i=0; i<6; i++) {
        
        if (l1<a[i]){
            l2 = l1;
            l1 = a[i];
        }
        
        if (l2<a[i] && a[i]!=l1)
            l2 = a[i];
    }
    
    printf("First largest number is %d\nSecond largest number is %d", l1, l2);
    
    return 0;
} 

Output - 


Explanation : -

1. Input the elements in the array (i.e. a[i]).

2. Intialize L1 and L2 as the element present on the index no. zero of elements.

3.  for (i=0; i<6; i++) {
        
        if (l1<a[i]){
            l2 = l1;
            l1 = a[i];
        }
        
        if (l2<a[i] && a[i]!=l1)
            l2 = a[i];
    }

In this loop it will check for if l1 < any element in array then make that element equals to array and make l1 = l2 then after this l1 and l2 will have the largest no. present in array stored in it.

In 2nd if statement it will check l2 < any element in array and that element is not equal to the elements present in l1 then it will be stored in l2.

After these step l1 will have largest no. stored in it and l2 have 2nd largest no. stored in it.

4. Print l1 and l2.

Comments

Post a Comment

Popular posts from this blog

WAP to add or to multiply two matrices of order nXn.

#include <stdio.h> int main() {     // Write C code here     int n1, n2, i, j, m1[10][10], m2[10][10], sum[10][10], mul[10][10], k;     printf("Enter the order of the matrix: ");     scanf("%d%d", &n1, &n2);     printf("Enter the elements of the 1st matrix: ");     for (i=0; i<n1; i++) {         for (j=0; j<n2; j++) {             scanf("%d", &m1[i][j]);         }     }     printf("Enter the elements of the 2st matrix: ");     for (i=0; i<n1; i++) {         for (j=0; j<n2; j++) {             scanf("%d", &m2[i][j]);         }     }     for (i=0; i...
Read more

WAP that inputs two arrays and saves sum of corresponding elements of these arrays in a third array

  #include <stdio.h> int main() {     int a[50], b[50], sum[50], i, n;     printf("Enter the Elements in an array: ");     scanf("%d", &n);     printf("Enter the Elements of 1st array: ");     for (i=0; i<n; i++)     scanf("%d", &a[i]);     printf("Enter the Elements of 2nd array: ");     for (i=0; i<n; i++)     scanf("%d", &b[i]);     for (i=0; i<n; i++)     sum[i] = a[i] + b[i];          printf("Sum of the corresponding element of 1st and 2nd array is ", sum[i]);     for (i=0; i<n; i++)     printf("%d,", sum[i]);     return 0; }
Read more

WAP to find the minimum and maximum element of the array by using functions.

  #include <stdio.h> int max(int arr[], int n) {     int max = arr[0];     for(int i=0; i<n; i++) {         if (max < arr[i])         max = arr[i];     }     return max; } int min(int arr[], int n) {     int min = arr[0];     for(int i=0; i<n; i++) {         if (min > arr[i])         min = arr[i];     }     return min; } int main() {     int n, arr[50], i;     printf("Enter the number of element in an array: ");     scanf("%d", &n);     printf("Enter the elements in the array: ");     for (i=0; i<n; i++)     scanf("%d", &arr[i]);     printf("The maximum element of array is %d\nThe minimum elemen...
Read more