Week 6

Well I we got our midterms back and I'm happy to say I got 90+% Yay! Also my assignment 1 I have requested a remark because of a mismark on the assignment. The study on binary trees and efficiency this week is very interesting because i do prefer learning about the theoretical stuff and applying it right after. I found this show call "Extra Credits" that teaches how to game design on youtube which I may find useful in the near future. We got our assignment 2 this week which was something I have not done before as regular expression was not the usual programming I have done but I still found it interesting because learning something new is always good. We are working with sorted tree this week for exercise 6 and I feel weird how we are told not to use recursion. I think Danny is getting to my head with only use of recursion because now I can barely program without recursion (he wins this time).

week 5

This week we had an assignment where we create a binary tree using a preorder and inorder traversal.  It was probably the most interesting one so far because this one required more thought than the other ones. This is where recursion helped a lot because the tree can be broken down to its node, left, and right. We also had our first test which was easy enough to do. My mistake was my test case required to test an empty list.

Week 4

This week we don't have an excersize or an assignment but there was an interesting lab. The most interesting thing in the lab was converting decimal to any k base (under 9) number using recursion. Its thanksgiving so we don't have anything for programming but personally I am writing a website to profile myself as a side project outside of school. More interesting things next week!

Week 3 (OOP & Recursion)

So this week we have a topic! OOP and Recursion!

Well anyways, this week has been tiring and honestly quick hectic. Working on assignment 1, it took wayyy longer time than I expected. The first couple of steps was a breeze but when it came down to solving Tour with 4 cheeses (Reve's Puzzle according to Wolframalpha (which I recommend you to check out)) to be frank was a very difficult problem. Also trying to learn read and learn Tkinter in a week was not exactly easy either. Anyways, I survived and I finished the project, but I did not make Controller.py because if I did, it was purely for the sake of making the class to satisfy the optional requirement and not for saving code (as my Solver and Manual were almost completely different). Enough with this and time to get my opinion on OOP and Recursion (if you care)

OOP is probably the best thing ever. OOP, or object oriented programming, is making a set of code in which it can reused and make multiple instances of by another code. It allows me to make 1 set of code for something and keep reusing the same code with different constructors to get different thing. I honestly don't know how to program large scale program without OOP because that was the only way I learnt how to program. That might be why I don't like Python so much because it (technically) is a scripting language and OOP was added later. OOP is what industries use to make large program as it can then divide up the work into smaller parts. In my opinion, OOP is the only way to go.

Recursion is the idea of calling itself (the function itself) in order to solve a problem. Recursion is very mind boggling in the sense it can make large scale problems into seemingly small ones. An example would be the Tower of Hanoi as the recursion is used to solve this type of problem. It's useful in the sense it can solve problems quite efficiently, but I myself am not very good at it and would prefer to iterate. It is true Recursion is cleaner and a better solution, and in some scenarios the only way to go, but as a student, I still lack the skills into solving problems with recursion, hopefully I'll get better at it. Still very mind boggling every time I make a depth first search with it.