CSC290 LazarLolic

Recursion, in programming, is an algorithm for solving problems that depend on smaller versions of the problem. To solve a large problem, we would first solve a smaller version of the problem and then combine it with something to solve the original problem. We would keep solving smaller versions of the problem until we reach the base case which is the smallest version of the problem. Then we would work backwards combining the outputs and finally solving the original problem. In most programming languages recursion is done by allowing functions to call themselves from inside the function. When writing a recursive function, it is important that we define the correct base case so that our program will eventually terminate. Not having the correct base case, or not having a base case at all, will allow our program to keep making recursive calls, and it will never know to stop. It is also important that we only make recursive calls on smaller and smaller inputs. If our inputs do not ...

One of the best public speakers, and one of my favourites, is Steve Jobs. All his Apple product presentations were enjoyable to watch, and he sold the product extremely well. People would come from all over the world to see his presentations and to learn from his impressive presentation style. The first Apple presentation I saw was for the iPhone 5. I only planned to watch the part where he introduced the product, but Steve Jobs “drew me in”.   I ended up watching the whole presentation and thought to myself: “I want to be able to present like this in the future.” I then went on to watch some of his other presentations and I was intrigued. His presentation style was like no other. His slides had a single colour background with white text on them. The slides would have close to no information on them, yet he would put so much information across to the audience. This was something that I enjoyed seeing and something that I strive to be able to replicate. Steve Jobs would al...