a52ebce9f2
finding the minimum and maximum of an array with at most 3n/2 - 2 comparisons Approved by: co-mentor (vanilla)
7 lines
211 B
Text
7 lines
211 B
Text
Algorithm::MinMax finds the minimum and maximum of a given
|
|
array with at most 3n/2 - 2 comparisons, where n is the
|
|
number of elements of the array.
|
|
|
|
WWW: http://search.cpan.org/dist/Algorithm-MinMax
|
|
|
|
--clsung
|