The divide and conquer solution makes use of a specific property of the minimum of a set of numbers, i.e. `\min(S) = \min(\min(A), \min(B))`, where `S` is a set of numbers and `A \cup B = S`
Try to write a proof of this property.
cs1102/tut5.txt · Last modified: 2009/03/19 18:01 by melvin