New answers tagged

1

In applications to time complexity of algorithms, you are often only interested bounding the growth (i.e., $O(), \Omega()$ asymptotics), and often the initial values incide as multiplicative factors to the solution (or their influence is swamped by the growth of terms that don't include them). So you'll often see sloppy statements that omit initial values.


Top 50 recent answers are included