big o - could some one explain time complexity to me from this image -
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
Post a Comment