RosettaCodeData/Task/Binary_search/Haskell/binary_search-2.hs

6 lines
179 B
Haskell

import Data.Array
binarySearchArray :: (Ix i, Integral i, Ord e) => Array i e -> e -> Maybe i
binarySearchArray a x = binarySearch p (bounds a) where
p m = x `compare` (a ! m)