Given an array of unsorted integers, implement a recursive method to find the minimal value.

Input: 3, 7, 12, -3, 6, 0, -1, 23

Output: -3

(Hint: you can refer to the merge sort as listing 11.7)

## Thursday, November 12, 2009

Subscribe to:
Post Comments (Atom)

## No comments:

Post a Comment