Rosetta Code

Isqrt (integer square root) of X

Compute integer square roots with a binary search over fixed sample inputs.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/isqrt_integer_square_root_of_x.vibe
def isqrt(value: int) -> int
  if value < 2
    return value
  end

  low = 1
  high = (value // 2) + 1
  answer = 1

  while low <= high
    middle = (low + high) // 2
    square = middle * middle

    if square == value
      return middle
    elsif square < value
      answer = middle
      low = middle + 1
    else
      high = middle - 1
    end
  end

  answer
end

def run -> array<{ isqrt: int, value: int }>
  values = [0, 1, 2, 3, 4, 10, 27, 81, 12345]
  rows: array<{ isqrt: int, value: int }> = []
  index = 0

  while index < values.length
    value = values.fetch(index)
    rows.push({
      value: value,
      isqrt: isqrt(value)
    })
    index = index + 1
  end

  rows
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.