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

ubuntu - PHP script to find files of certain extensions in a directory, returns populated array when run in browser, but empty array when run from terminal -

php - How can i create a user dashboard -

javascript - How to detect toggling of the fullscreen-toolbar in jQuery Mobile? -