หาค่ามากสุดในอาร์เรย์

#include <stdio.h>
int main(void) {
    int values[] = {-4, 7, 23, 9, 12}; int maximum = values[0];
    // Compare every remaining value with the current maximum.
    for (size_t i = 1; i < sizeof values / sizeof values[0]; ++i)
        if (values[i] > maximum) maximum = values[i];
    printf("max=%d\n", maximum);
}

#include <algorithm>
#include <iostream>
#include <vector>
int main() {
    std::vector values{-4, 7, 23, 9, 12};
    // max_element returns an iterator to the largest value.
    std::cout << "max=" << *std::max_element(values.begin(), values.end()) << '\n';
}