Divide Two Numbers Without Division

Hewlett Packard Enterprise Development systems may need arithmetic logic implemented without relying on hardware division or multiplication instructions. Given two integers, compute the quotient without using /, //, or *.

Requirements

Implement divide(a, b) with these rules:

1. Return the quotient of a divided by b, truncated toward zero.
2. b is never zero.
3. Do not use division, floor division, multiplication, exponentiation, or equivalent library operations.
4. Use addition, subtraction, comparison, and basic control flow. Bit shifts are not required.
5. Clamp the result to the signed 32-bit range [-2147483648, 2147483647].

The solution should improve on subtracting the divisor one time per quotient unit by repeatedly doubling the largest usable divisor chunk.

Formal Specification

Input: two integers a and b.

Output: one integer representing a / b, truncated toward zero and clamped to the signed 32-bit range.