As soon as I started writing the expanded definition for \u201crecursion\u201d, I started to regret choosing the particular word. While it\u2019s a commonly used word in computer science, it\u2019s 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.<\/p>\n
However, I\u2019ve 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!\u00a0 <\/span>I also understand why she still had confusion regarding my second example of recursion involving Fibonacci\u2019s sequence.<\/p>\n Fibonacci\u2019s sequence is so commonly used in computer science teachings that I forgot that it isn\u2019t\u00a0 <\/span>common knowledge. With Harsha\u2019s help I started to take a step back from the definition and kept asking myself \u201cWould I understand this without any computer science education?\u201d. When you\u2019re surrounded by people with the same knowledge as you, it\u2019s very easy to forget that not everyone knows the same thing.<\/p>\n I hope with the edits and further elaboration on the topic make the expanded definition even easier to understand.<\/p>\n Attached below are a word document of my definitions, and a link to Harsha’s review of my expanded definition.<\/p>\n