Skip to content

pc-ip-18.c

Problem Statement

Question 18: Write a C program that includes a user-defined function named findLargest with the signature int findLargest(int arr[], int size);.

Metadata

Property Detail
Author Amit Dutta amitdutta4255@gmail.com
Date 05 Jan 2026
License MIT License (See the LICENSE file for details)
Difficulty Intermediate (index: 4 / 10)

Concepts

Beta Feature

This concept detection system is still in beta and may occasionally show incorrect or incomplete results.

  • Array
  • Pointers
  • Iteration
  • Sorting (possible)
  • Recursion

Actions

Raw View on GitHub

You can print or save this file by opening Raw and using your browser.

Source Code

#include <stdio.h>
#include <stdlib.h>

int findLargest(int[], int);
void inputArray(int[], int);
void printArray(int[], int);

int main()
{
    int n, *arr = NULL;
    printf("Enter the number of element: ");
    scanf("%d", &n);
    if (n < 2)
    {
        printf("\nTo get highest element, there must be atleast 2 element.");
        return 1;
    }
    arr = (int *)malloc(n * sizeof(int));
    if (arr == NULL)
    {
        printf("\nMemory allocation failed.");
        return 1;
    }
    inputArray(arr, n);
    printf("\nGiven Array: ");
    printArray(arr, n);
    printf("\nLargest element of the array: %d", findLargest(arr, n));
    free(arr);
    return 0;
}

void inputArray(int arr[], int n)
{
    int i;
    for (i = 0; i < n; i++)
    {
        printf("Enter element %d: ", i + 1);
        scanf("%d", &arr[i]);
    }
}

void printArray(int arr[], int n)
{
    int i;
    printf("[");
    for (i = 0; i < n; i++)
    {
        printf("%d", arr[i]);
        if (i < n - 1)
        {
            printf(", ");
        }
    }
    printf("]");
}

int findLargest(int arr[], int size)
{
    int i, largest = arr[0];
    for (i = 1; i < size; i++)
    {
        if (arr[i] > largest)
        {
            largest = arr[i];
        }
    }
    return largest;
}

Explanation

Explain with AI

Copy the prompt below and paste it into any AI assistant.

    You are explaining a C programming code to a beginner.

    STRICT RULES:

    - Only use the given code. Do NOT assume anything not present.

    - Do NOT add extra examples.

    - Keep explanation clear and short.

    - If something is unclear, say "Not clear from code".

    - Follow the exact format below. Do NOT change headings.

    FORMAT:

    [START]

    ## What it does

    (Explain the overall purpose in 1-2 sentences)

    ## Step-by-step

    (Explain how the code works in steps, simple language)

    ## Key Concepts

    (List concepts like loop, condition, function, etc.)

    ## Notes

    (Mention any limitations, errors, or assumptions)

    [END]

    CODE (pc-ip-18.c):

    #include <stdio.h>
    #include <stdlib.h>

    int findLargest(int[], int);
    void inputArray(int[], int);
    void printArray(int[], int);

    int main()
    {
        int n, *arr = NULL;
        printf("Enter the number of element: ");
        scanf("%d", &n);
        if (n < 2)
        {
            printf("\nTo get highest element, there must be atleast 2 element.");
            return 1;
        }
        arr = (int *)malloc(n * sizeof(int));
        if (arr == NULL)
        {
            printf("\nMemory allocation failed.");
            return 1;
        }
        inputArray(arr, n);
        printf("\nGiven Array: ");
        printArray(arr, n);
        printf("\nLargest element of the array: %d", findLargest(arr, n));
        free(arr);
        return 0;
    }

    void inputArray(int arr[], int n)
    {
        int i;
        for (i = 0; i < n; i++)
        {
            printf("Enter element %d: ", i + 1);
            scanf("%d", &arr[i]);
        }
    }

    void printArray(int arr[], int n)
    {
        int i;
        printf("[");
        for (i = 0; i < n; i++)
        {
            printf("%d", arr[i]);
            if (i < n - 1)
            {
                printf(", ");
            }
        }
        printf("]");
    }

    int findLargest(int arr[], int size)
    {
        int i, largest = arr[0];
        for (i = 1; i < size; i++)
        {
            if (arr[i] > largest)
            {
                largest = arr[i];
            }
        }
        return largest;
    }