Go backward to Parallel Algorithm Go up to Top Go forward to Comparison

Minimum of n Values

Tree-like minimum construction

Depth of tree = computation time = O(logn)