Revision as of 17:33, 18 January 2008 (view source) 79.213.76.52 (talk) No edit summary ← Older edit		Revision as of 00:37, 28 January 2008 (view source) rosettacode>Mwn3d m (Added to recursion category) Newer edit →
Line 1: {{task}}[[Category:Recursion]] A binary search divides a range of values into halves, and continues to narrow down the field of search until the unknown value is found. It is the classic example of a "divide and conquer" algorithm.

Binary search (view source)