28 ms·
Because division is not trivial. Even computing x mod 3 for an n-bit integer x is O(n), if x is represented in the binary form.
by Spoof7726 2y ago
Because division is not trivial. Even computing x mod 3 for an n-bit integer x is O(n), if x is represented in the binary form.