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 @ErikSchierboom (⭐ 0) — View on Exercism
Solution 2 by @Wraith29 (⭐ 0) — View on Exercism
Solution 3 by @smnths (⭐ 0) — View on Exercism

Source: Exercism nim/binary-search

💡 View Solution

proc binarySearch*(a: openArray[int], val: int): int =
  var left = a.low
  var right = a.high

  while left <= right:
    let middle = (left + right) div 2
    if a[middle] < val:
      left = middle + 1
    elif a[middle] > val:
      right = middle - 1