Skip to main content

Featured

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...

Third Smallest Element in Array using bubble sort C program

Third Smallest Element in Array - C Program

๐Ÿงฎ Find Third Smallest Element in Array (C Program)

#include <stdio.h>

void thirdSmallest(int a[], int num)
{
    // Sort array in ascending order using Bubble Sort
    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;
            }
        }
    }

    // Directly print the third element after sorting
    printf("Third smallest element in the array: %d\n", a[2]);
}

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 smallest element.\n");
        return 1;
    }

    int a[num];
    printf("Enter %d elements:\n", num);
    for (int i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }

    thirdSmallest(a, num);
    return 0;
}
  

๐Ÿ“˜ Explanation:

  • Reads the number of elements and validates a minimum of 3 elements.
  • Uses Bubble Sort to sort the array in ascending order.
  • Prints the 3rd element from the sorted array, which is the third smallest.
  • If fewer than 3 elements are entered, it prints an error message.

๐Ÿงช Sample Output:

Enter the size of the array:
6
Enter 6 elements:
45 21 78 12 89 10
Third smallest element in the array: 21
    

๐Ÿท️ Keywords:

third smallest element in array, C array sorting, bubble sort example, C beginner array program, find nth smallest

Comments

Popular Posts

๐ŸŒ™