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...
Post a Comment
Read more
Labels

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.

Labels:

Comments

Post a Comment

Popular Posts

🌙