As soon as I started writing the expanded definition for “recursion”, I started to regret choosing the particular word. While it’s a commonly used word in computer science, it’s a term that can be hard to explain without practical experience. When I first learnt how to solve problems using recursion, it took a long time for the process to click. Like I mention in my definitions, a recursive problem is like a picture within a picture. It can be a bit of a trippy situation.
However, I’ve always felt that I can understand something better if I am able to explain the topic to someone else. I believe that the process of writing a definition for recursion that is beginner-friendly has helped cement my understanding of the topic. When Harsha said she was able to understand the definition I was very happy! I also understand why she still had confusion regarding my second example of recursion involving Fibonacci’s sequence.
Fibonacci’s sequence is so commonly used in computer science teachings that I forgot that it isn’t common knowledge. With Harsha’s help I started to take a step back from the definition and kept asking myself “Would I understand this without any computer science education?”. When you’re surrounded by people with the same knowledge as you, it’s very easy to forget that not everyone knows the same thing.
I hope with the edits and further elaboration on the topic make the expanded definition even easier to understand.
Attached below are a word document of my definitions, and a link to Harsha’s review of my expanded definition.
Three-Definitions-Madeleine-Leroux