How do I think about recursion. |
How do I think about recursion. |
shivajikobardan |
Dec 11 2022, 02:40 AM
Post
#1
|
Group: Members Posts: 4 Joined: 5-June 22 Member No.: 28,377 |
I got the idea for problems like factorials or finding sum from 1 to n, where there's a pattern visible. Like this:
Source:https://99x.io/blog/recursion-is-not-hard-here-is-the-right-way-to-think I got it for things like addition, subtraction, division, multiplication of two numbers as well. eg: a+b =a+b-1+1 =SUM(a+1,b-1) Now, I am wondering how it'll be for finding a palindrome of a number? I've a solution but I'm not understanding how we came towards it. I'm looking for how to come towards a solution than a solution itself. |
Lo-Fi Version | Time is now: 4th June 2024 - 10:45 PM |