Skip to main content

Featured

C Program to Solve Two Sum Using Brute Force (With Algorithm & Output)

 Introduction The Two Sum problem is a popular coding interview question where we must find two indices of an array whose values add up to a given target. This program demonstrates a simple brute-force solution in C using nested loops and dynamic memory allocation. Problem Statement Given an integer array and a target value, return the indices of the two numbers such that they add up to the target. Each input has exactly one solution, and the same element cannot be used twice. The result should return the indices, not the values. If no solution exists, return NULL.  Algorithm / Logic Explanation Start the program. Traverse the array using a loop from index 0 to numsSize - 1 . Inside this loop, use another loop starting from i + 1 to numsSize - 1 . For every pair (i, j) , check if nums[i] + nums[j] == target . If condition becomes true: Allocate memory for 2 integers using malloc() . Store indices i and j . Set returnSize = 2 . Return the result poi...

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

๐ŸŒ™