Introduction
This is an introduction of Straight min max algorithm.
Language: C
#include <stdio.h>
void arr_min_max(int arr[], int size, int *min, int *max) {
*min = *max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > *max) {
*max = arr[i];
} else if (arr[i] < *min) {
*min = arr[i];
}
}
}
int main() {
int n;
printf("Enter size of array : ");
scanf("%d",&n);
int arr[n];
printf("Enter the array: \n");
for(int i =0;i < n;i++)
scanf("%d",&arr[i]);
int min, max;
arr_min_max(arr,n, &min, &max);
printf("Minimum value: %d\n", min);
printf("Maximum value: %d\n", max);
return 0;
}
Output:
Enter size of array : 5
Enter the array:
4 7 3 9 10
Minimum value: 3
Maximum value: 10
Language: C++
#include <iostream>
#include <vector>
void arr_min_max(const std::vector<int>& arr, int& min, int& max) {
min = max = arr[0];
for (int i = 1; i < arr.size(); i++) {
if (arr[i] > max) {
max = arr[i];
} else if (arr[i] < min) {
min = arr[i];
}
}
}
int main() {
int n;
std::cout << "Enter size of array : ";
std::cin >> n;
std::vector arr(n);
std::cout << "Enter the array: \n";
for(int i = 0; i < n; i++)
std::cin >> arr[i];
int min, max;
arr_min_max(arr, min, max);
std::cout << "Minimum value: " << min << "\n";
std::cout << "Maximum value: " << max << "\n";
return 0;
}
Output:
Enter size of array : 4 Enter the array: 47 29 18 1 Minimum value: 1 Maximum value: 47