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

Find Nth Largest Number in an Array (C Program)

Find Nth Largest Number in an Array (C Program)

✅ C Program to Find the Nth Largest Number in an Array

#include <stdio.h>

// Function to sort array in descending order
void sortDescending(int arr[], int size) {
    for(int i = 0; i < size-1; i++) {
        for(int j = i+1; j < size; j++) {
            if(arr[i] < arr[j]) {
                // Swap
                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
}

int main() {
    int arr[100], n, size;

    printf("Enter the size of array: ");
    scanf("%d", &size);

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

    printf("Enter the value of n (e.g., 1st, 2nd largest): ");
    scanf("%d", &n);

    if(n <= 0 || n > size) {
        printf("Invalid value of n!\n");
        return 1;
    }

    // Sort the array in descending order
    sortDescending(arr, size);

    printf("The %dth largest number is: %d\n", n, arr[n - 1]);

    return 0;
}
  

๐Ÿ“˜ Explanation:

This program accepts an array of integers from the user and then finds the nth largest number. It sorts the array in descending order using a simple selection sort logic, then returns the (n - 1)th index element as the nth largest.

  • sortDescending() is a helper function that arranges the elements in descending order.
  • User inputs the size of the array, the array elements, and the value of n.
  • Program validates n to ensure it's within the range.
  • It returns the required element after sorting.

๐Ÿงพ Sample Output:

Enter the size of array: 5
Enter 5 elements:
10 50 30 20 40
Enter the value of n (e.g., 1st, 2nd largest): 3
The 3th largest number is: 30
  

๐Ÿ”‘ Keywords:

nth largest number, sort array in C, array logic, sorting algorithms, find max values, C interview programs, AdSense code snippets

๐Ÿ“Œ Hashtags:

#CProgramming #ArraySorting #NthLargest #InterviewQuestion #BeginnerFriendly #AdSenseCCode #CodeWithLogic

๐Ÿ” Search Description:

This C program finds the nth largest number from a given array using sorting. It sorts the array in descending order and returns the required position element. Easy to understand and ideal for learning array manipulation logic.

Comments

Popular Posts

๐ŸŒ™