Question

How to find the min and max of an int array in C++

Answer 1

#include <iostream>
#include <climits>

int main() {
    int arr[] = {3, 14, 4, 1, 5, 90, 2, 6, 89, 3, 7};
    int size = sizeof(arr) / sizeof(arr[0]);

    int min = INT_MAX;
    int max = INT_MIN;

    for (int i = 0; i < size; ++i) {
        if (arr[i] < min) {
            min = arr[i];
        }
        if (arr[i] > max) {
            max = arr[i];
        }
    }

    std::cout << "Minimum: " << min << std::endl;
    std::cout << "Maximum: " << max << std::endl;
}



/*
run:

Minimum: 1
Maximum: 90

*/

 

70+ SQL courses for beginners and professionals

Answer 2

#include <iostream>
#include <algorithm>

int main() {
    int arr[] = {3, 14, 4, 1, 5, 90, 2, 6, 89, 3, 7};
    int size = sizeof(arr) / sizeof(arr[0]);

    int min = *std::min_element(arr, arr + size);
    int max = *std::max_element(arr, arr + size);

    std::cout << "Minimum: " << min << std::endl;
    std::cout << "Maximum: " << max << std::endl;
}



/*
run:

Minimum: 1
Maximum: 90

*/

 

70+ SQL courses for beginners and professionals

Answer 3

#include <iostream>
#include <utility>

std::pair<int, int> findMinMax(int arr[], int size) {
    int min = arr[0];
    int max = arr[0];

    for (int i = 1; i < size; ++i) {
        if (arr[i] < min) {
            min = arr[i];
        }
        if (arr[i] > max) {
            max = arr[i];
        }
    }

    return std::make_pair(min, max);
}

int main() {
    int arr[] = {3, 14, 4, 1, 5, 90, 2, 6, 89, 3, 7};
    int size = sizeof(arr) / sizeof(arr[0]);

    std::pair<int, int> result = findMinMax(arr, size);

    std::cout << "Minimum: " << result.first << std::endl;
    std::cout << "Maximum: " << result.second << std::endl;
}



/*
run:

Minimum: 1
Maximum: 90

*/

 

70+ SQL courses for beginners and professionals