This week we continued to learn the recursion of images. It was not hard because we've already learnt it last week. When you enter a number into the function, the first thing is to check if it satisfy the first condition which is greater than 0. If it's not, then just skip the definition and go straight to "else". If it is greater than 0, then we replace all the "d"s inside of the function and to see what would happen. A tip of this is that you assume the computer has known what would be produced in the previous number under the function. I think it was really fun because when you enter a large number, you will see a amazing pattern.
Also, in terms of computer history, we learnt the operating systems. In the past, one computer can only run one program at one time. But nowadays computers can run several programs at the same time.
Wikipedia Part III should be done at the end of this week. I found it easy to add new content to the article but I actually didn't know how to engage in the wikipedia community. I sent an email to professor to ask him about it, then he told me to go to the talk page. I found some wikipedians who also worked on the same article with me, and talked to them.
没有评论:
发表评论