Binary Search

Challenge Overview

Implement a binary search algorithm.

Visit the binary-search exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

View Community Solutions

The following are the top 3 community solutions by stars:

Solution 1 by @Mlinzo (⭐ 0) — View on Exercism
Solution 2 by @dbalmain (⭐ 0) — View on Exercism
Solution 3 by @magthe (⭐ 0) — View on Exercism

Source: Exercism haskell/binary-search

💡 View Solution

module BinarySearch (find) where

import Data.Array

find :: Ord a => Array Int a -> a -> Maybe Int
find xs target = bSearch xs target left right
    where
        (left, right) = bounds xs

bSearch :: Ord a => Array Int a -> a -> Int -> Int -> Maybe Int