Skip to content

P062.c

Problem Statement

Write a C program to find the smallest and largest in an array using user-defined functions. Define two functions int findSmallest(int arr[], int n) and int findLargest(int arr[], int n) that return the smallest and largest elements in an array, respectively.

Metadata

Property Detail
Author Amit Dutta amitdutta4255@gmail.com
Date 16 Dec 2025
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>

void inputarr(int[], int);
int findSmallest(int[], int);
int findLargest(int[], int);

int main()
{
    int n, *arr;
    printf("How many element do you want to enter: ");
    scanf("%d", &n);
    arr = (int *)malloc(n * sizeof(int));
    inputarr(arr, n);
    printf("\nSmallest element = %d", findSmallest(arr, n));
    printf("\nLargest element  = %d", findLargest(arr, n));
    free(arr);
    return 0;
}

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

int findSmallest(int arr[], int n)
{
    int i, smallest = arr[0];
    for (i = 1; i < n; i++)
    {
        if (smallest > arr[i])
        {
            smallest = arr[i];
        }
    }
    return smallest;
}

int findLargest(int arr[], int n)
{
    int i, largest = arr[0];
    for (i = 1; i < n; i++)
    {
        if (largest < arr[i])
        {
            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 (P062.c):

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

    void inputarr(int[], int);
    int findSmallest(int[], int);
    int findLargest(int[], int);

    int main()
    {
        int n, *arr;
        printf("How many element do you want to enter: ");
        scanf("%d", &n);
        arr = (int *)malloc(n * sizeof(int));
        inputarr(arr, n);
        printf("\nSmallest element = %d", findSmallest(arr, n));
        printf("\nLargest element  = %d", findLargest(arr, n));
        free(arr);
        return 0;
    }

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

    int findSmallest(int arr[], int n)
    {
        int i, smallest = arr[0];
        for (i = 1; i < n; i++)
        {
            if (smallest > arr[i])
            {
                smallest = arr[i];
            }
        }
        return smallest;
    }

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