Skip to main content

Week 11: A trip down memory lane

Hello friends!!

 How do you do today? Week 11 has just happened and boy did this semester go by quickly. For this week's post, I would like to talk about tracing recursion (or rather recursion, in general), which I talked about in my week 5 post. 

 Ah... good ol' recursion. In week 5 we were only responsible for tracing, and without having to code. Back then I thought coding recursive functions was something that I could handle. Now, 6 weeks later, my much older, wiser self agrees, somewhat. Firstly, I would like to say that I am not the hardest worker, nor am I the smartest cookie in the cookie jar. However, I can usually understand something the first time someone explains something to me. With recursion, that was definitely not the case. It took so much time and way more effort than I thought to understand. The 'recursive thinking' definitely does not come innately to me. With that said, it is not like organic chemistry (which is my personal kryptonite) so I was able to eventually understand the concept and I am so happy that I am finally able to say that. It feels good being able to understand something so fundamental but still so crucial to computer programming.

 It seems that many of my fellow classmates had the same initial thoughts on recursion, since most of us had never done this before. If you would like to read up on other's impressions, here are my suggestions: 

 http://148slogger.blogspot.ca/

 https://kristinamadethis.wordpress.com/

 http://148choi.blogspot.ca/

 All of these blogs are well written and interesting to read.

 That's it for today folks! Have a dandy week and get psyched for the last week of classes!!!
Lana :D

Labels:

Comments

Post a Comment

Popular posts from this blog

Week 12: Halting Problem Visualized

Hello readers! I'm sure you're all hard at work trying to finish assignment 3. I just wanted to take a few minutes to share with you a video I found on the halting problem. It may be a tad overdramatic (especially with the music) and corny, but it does explain the problem quite well. Here's part 1 (which can be skipped if you want): And part 2, which is where the real explanation of the halting function starts (skip to 2:33 if you don't like corny dialogue): Hopefully this helps with your endeavors (or at least is a bit entertaining)! Good luck with the assignment! Lana :)
Post a Comment
Read more

Week 5: Tracing Recursion

Hello readers! How have you guys been recently? I have been bombarded with a myriad of tests, labs, and assignments, as usual, but I'll holding up alright! Today's blurb is on tracing recursion! As you all know, a recursive function is basically any function that is called within itself. You'll need it any time a bigger problem can be solved by solving smaller versions of a same type of problem until you get your answer to the big one. Kind of. At least that's how I see it. Anyhow, tracing recursion is not as bad as it sounds, it takes some bit of practice, of course, but all in all it will eventually click. Tracing recursion was on the test this week went successfully I should think. The quasi-solution I came out with with involved the function we needed to trace giving the maximum length of any lists that were fed into it, including the length of the overall list. If I am correct, then my tracing would have been successful. We shall see in due time! Bu...
Post a Comment
Read more

Week 10: How to solve a problem

Hello my good friends! This week is the coveted fall reading break, and I hope you all are doing something useful with your time, like me, who is currently writing my SLOG. Now that the course is nearing its end, I would like to take it back to the beginning and try to solve one of those logic puzzles, using the Polya method we learned in class. I am, afterall, an amateur logician now, am I not? So here is the puzzle I have found from the problem solving wiki page. So without further ado, I present to you: Walk Tilings Suppose you have tiles that are 1x2 rectangles, and you have to tile a walk that is 2x3 units long. You've got three choices: 3 vertical tiles, 1 vertical tile followed by two horizontal tiles, or two horizontal tiles followed by one vertical tiles. How many choices do you have in tiling a 2x4 walk? How about a 2xn walk, where n is some natural number? Do you have a procedure that works for any n? Understanding the Problem Ultimately ...
Post a Comment
Read more