C++ Program to Find the Minimum and Maximum Element of an Array
Last Updated :
17 Jan, 2023
Given an array, write functions to find the minimum and maximum elements in it.Â
Example:
C++
#include <bits/stdc++.h>
using namespace std;
int getMin( int arr[], int n)
{
return *min_element(arr, arr + n);
}
int getMax( int arr[], int n)
{
return *max_element(arr, arr + n);
}
int main()
{
int arr[] = { 12, 1234, 45, 67, 1 };
int n = sizeof (arr) / sizeof (arr[0]);
cout << "Minimum element of array: " << getMin(arr, n) << " " ;
cout << "Maximum element of array: " << getMax(arr, n);
return 0;
}
|
Output:Â
Minimum element of array: 1
Maximum element of array: 1234
Time Complexity: O(n)
Auxiliary Space: O(1), as no extra space is used
Recursive SolutionÂ
Example:
Output:Â
Min of array: 1
Max of array: 1234
Time Complexity: O(n)
Auxiliary Space: O(n), as implicit stack is used due to recursion
Using Library functions:Â
We can use min_element() and max_element() to find minimum and maximum of array.Â
Example:
C++
#include <bits/stdc++.h>
using namespace std;
int getMin( int arr[], int n)
{
return *min_element(arr, arr + n);
}
int getMax( int arr[], int n)
{
return *max_element(arr, arr + n);
}
int main()
{
int arr[] = { 12, 1234, 45, 67, 1 };
int n = sizeof (arr) / sizeof (arr[0]);
cout << "Minimum element of array: " << getMin(arr, n) << " " ;
cout << "Maximum element of array: " << getMax(arr, n);
return 0;
}
|
Output:
Minimum element of array: 1
Maximum element of array: 1234
Time Complexity: O(n)
Auxiliary Space: O(1), as no extra space is used
Â
Share your thoughts in the comments
Please Login to comment...