3 ms·
No. If the inductive step is that n lines of code is n! difficulty his base cases are still valid. There is no induction with no inductive hypothesis.
by Locke1689 16y ago
No. If the inductive step is that n lines of code is n! difficulty his base cases are still valid.
There is no induction with no inductive hypothesis.
- presidentender 16y agoYou write one line of code, say "printf("Hello, World!");" ten thousand times. It's easy. Making it work together introduces the complexity.