Friday, 1 March 2013
During this week of class we began learning the runtime of the computers and roughly how long the computers take to run certain code. I found this very intriguing to be able to look inside the computer and see just how the computer processes the information and really how long it takes to do it. I'm also very excited to learn more about how the computer does harder tasks such as recursion or certain algorithms like sorting algorithms and running through binary trees and such.
Subscribe to:
Post Comments (Atom)
You'll probably have to wait until CSC236 (the follow-up to this course) to get in to proving bounds on things like recursion! Running through a binary tree is pretty simple though, if you think about it you can probably figure it out on your own (hint: let the size of the input 'n' to be the number of nodes in the tree).
ReplyDelete