reduce 10 -> 1 using recursion but minimun no. of step reqire to reach 1 using 3 operation each at single times. 1) subtract by1. 2) divide by 2 only if divisible by 2. 3)divide by 3 if only it divisible by 3.
and my code is
(IN MY CODE ANSWER IS COME WRONG)
I modified your code. Please check it.
We have to consider all the 3 cases so there is no need of else statement.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.