Hello,

The ceiling function is typically defined as ceiling(x) = min{n : x <= n}, where n is an integer.

What's the fastest algorithm that could perform this operation? (Without using the floor function.) Assume that the only operations you have available are addition, subtraction, multiplication, division, module, logarithm, and powers/exponents.