C program to find the third largest element in an array using bubble sort

January 03, 2026

C Program to Check Prime Number Using Efficient Logic

Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design. Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

C PROGRAM TO FIND THE THIRD LARGEST ELEMENT USING BUBBLE SORT

Source Code:

#include<stdio.h>

int thirdlargest(int a[], int num)
{
    for(int i = 0; i < num - 1; i++)
    {
        for(int j = 0; j < num - i - 1; j++)
        {
            if(a[j] > a[j+1])
            {
                int temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
            }
        }
    }
    printf("Third largest element in the array: %d\n", a[num - 3]);
}

int main()
{
    int num;
    printf("Enter the size of the array:\n");
    scanf("%d", &num);
    
    if(num < 3)
    {
        printf("Invalid! Need at least 3 numbers to find the third largest element.\n");
        return 1;
    }
    
    int a[num];
    printf("Enter %d elements:\n", num);
    for(int i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }
    
    thirdlargest(a, num);
    return 0;
}

Explanation:

This program uses the bubble sort method to find the third largest number in an array:

It first sorts the array in ascending order.
After sorting, the third largest number is the element at position num - 3.
It checks if the array has at least 3 elements before processing.

Sample Output:

Enter the size of the array:
6
Enter 6 elements:
10 25 33 50 8 40
Third largest element in the array: 33

Keywords:

third largest element in C, bubble sort example, array sorting in C, basic C programs with output, C programming questions

Search This Blog

1PRINTF

Featured

C Program to Check Prime Number Using Efficient Logic