" you have
recus(x) in your code, but you are doing absolutely nothing with the returned value"
That is my point…
I how can I do something with the return value, I only need
count value that recursion… How can I get it.
Then I don’t know how I can use only loop to solve this problem, because I will be dividing repeatedly until I have a odd number from the input value.
For instance, if input is 8, I have to divide it until I have a odd number, so the return value will now be an object consisting of the 8(which is input) as key and the number of division it undergo as(count) as the value.
This is not a challenge from anywhere, is what I just think of by myself and I believe if I could get through it, it can be applied to solve real life problem in the near future.
So put me through, use assumption to point me to relevant places where am making mistake…rather than merry-go-round…you can sight a closely related example, things like that…
We have talked to much on this problem.
I have display all I could, I even try to break it down in to simpler problem using a single input not an array again, believing if I could get it working with that, then I can come up with the array stuff all from their…at least that’s the way I have been reading it, ‘break big or huge problem into simpler one and tackle it from there.’