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

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

Largest Element in Array - C Program

๐Ÿ”น Find Largest Element in Array (C Program)

#include <stdio.h>

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

    // After sorting, the largest element is at index num - 1
    printf("Largest element in the array: %d\n", a[num - 1]);
}

int main()
{
    int num;
    printf("Enter the size of the array:\n");
    scanf("%d", &num);

    if(num < 1)
    {
        printf("Invalid! Need at least 1 number to find the 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]);
    }

    largestElement(a, num);
    return 0;
}
  

๐Ÿ“˜ Explanation:

  • Reads the array size and elements from the user.
  • Sorts the array using Bubble Sort in ascending order.
  • The largest element will be at the last index (num - 1) after sorting.
  • If size is less than 1, it gives an error message.

๐Ÿงช Sample Output:

Enter the size of the array:
5
Enter 5 elements:
10 45 3 89 27
Largest element in the array: 89
    

๐Ÿท️ Keywords:

largest number in array, C program for max element, bubble sort, array processing in C, beginner C logic, find max in array

Comments

Popular Posts

๐ŸŒ™