What if I pass the same argument twice to std::min?

Arguments may be evaluated more than once — avoid side effects. C++17 clamp can express intent more safely.

Why use minmax in one call?

One pass can return both min and max, saving a second scan on large ranges.

When you need an iterator (position), not only the value.

Mixing up nested min/max bounds; clamp fixes inclusive [lo, hi] semantics when lo <= hi.

2026년 3월 12일 · 16분 읽기 · 수정 2026년 3월 30일 Beginner tutorial

Single reference for min/max on values and ranges, plus clamp and practical patterns.

They find minimum and maximum values: overloads for two or more values, and range algorithms returning iterators.

Why use them?

Overview

API	Input	Returns	Time
`min(a,b)` / `max`	2 values	reference	O(1)
`minmax(a,b)`	2 values	pair	O(1)
`min_element` / `max_element`	range	iterator	O(n)
`minmax_element`	range	pair of iterators	O(n)
`clamp(v, lo, hi)`	value + bounds	clamped value	O(1)

min / max: return references; watch dangling with temporaries (dangling reference).
minmax(a,b): one structured pair result.
min({a,b,c,...}): initializer_list overload for several values.

Return iterators so duplicate values can pick the first occurrence. Empty range → undefined behavior — check empty() first.

clamp(v, lo, hi) equals min(max(v, lo), hi). Requires lo <= hi or UB. Useful for UI bounds, physics caps, color channels.

Two-argument min/max is often inlined and negligible.
Prefer min_element over sort + front when you only need extremal values.
minmax_element: one scan for both extrema vs two separate passes.

Statistics (min/max + mean), range validation with clamp, and normalization using minmax_element span — same logic as the Korean article.

min/max vs min_element? Values vs iterators / positions.

minmax? Pair of extrema for two values.

clamp? Bound value to [lo, hi] (C++17).

Empty range? UB for *_element — guard with empty().

Resources? Effective STL, C++ Primer, cppreference — min.

std::min, std::max, minmax_element, clamp, min_element, max_element, STL