Write recursive and non-recursive versions of some functions and count for yourself.
You want to understand - write some code!
Write recursive and non-recursive versions of some functions and count for yourself.
You want to understand - write some code!
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I understand but I already wrote the code for loop solution and recursive solution above , so then what next step shall I do for proving what you're suggesting that recursive call counts same as for loop iterations counts?Originally Posted by Salem
you know we are talking about "n" number so cant count .. it might be that n very huge number yeah ..it's integer ..
