No, I am not forcing all n of any size to a constant, I'm saying that we can bottom out inductively for small n.
This is a very old discussion. Read Knuth's rationale. Then read the similar sections in Segwick et all or whatever other basic competence textbook on algorithms you like. Compare them, think about which contexts each approach is most useful in.
In other words, no, you have not somehow cleverly invalidated all of complexity analysis.
This is a very old discussion. Read Knuth's rationale. Then read the similar sections in Segwick et all or whatever other basic competence textbook on algorithms you like. Compare them, think about which contexts each approach is most useful in.
In other words, no, you have not somehow cleverly invalidated all of complexity analysis.