标签: time-complexity big-o
function f(n) begin if(n < 2) return 1 else f(ceiling(sqrt(n)) end
我假设它是Big O(log(n))或O(2log(n))或O(loglog(n))