$f(n)=f(n-\sqrt{n})$I believe $f(n)\in O(\sqrt{n})$However I cannot seem to prove it, my intuition comes from the fact that we can remove $\sqrt{n}$ exactly $\sqrt{n}$ times, but if $n$ shrinks then does anything change?
How do I find an upper bound on this recurrence
complexity theory;asymptotics;recurrence relation