big o - could some one explain time complexity to me from this image -


could 1 please explain why n >= 1 , not n >=0 since 0 true below argument

enter image description here

n>=0 not ok, definition in introduction algorithms(clrs), requires n positive. think reason use big-o notation make approximation of algorithm, want input, , n=0 means no input, don't want involve in our calculation.


Comments

Popular posts from this blog

python - Operations inside variables -

Generic Map Parameter java -

arrays - What causes a java.lang.ArrayIndexOutOfBoundsException and how do I prevent it? -