For what values of n is an algorithm that requires exactly n

$2$

$/$

$1$

$0$

$$operations take fewer

operations than an algorithm that requires exactly n log base $2$

$$n operations? For partial operations,

take the ceiling of the value, since a full operation is always required.