P062.c ​
Metadata ​
- Author — Amit Dutta
- Last updated — 16 Dec 2025
- License — MIT License (See the LICENSE file for details)
Problem Statement ​
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.
Source Code ​
Printing the code
To print this file, open it on GitHub and click Raw before printing, or use the Download Raw button above and print directly from that page.
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;
}1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55