Review

For the last 2 weeks, everything has pretty much gone into review mode in anticipation for the finals. With the last 2 labs being a review for sorts and binary trees. The last one in particular should be a good help to my preparation for the finals. The fibonacci and quicksort example was very interesting too

Quick Update

The exam last week was surprisingly not too hard since the questions were basically from the exercises/tutorials we had. Regarding the last lab we had, I couldn't quite say that it was particularly productive in the sense that the majority of the time was spent on waiting for the computer to finish running the sorting. However, I did come to the conclusion that bubble sorts and selection sorts are all terribly slow. I was very surprised to find that the built in list.sort function was incredibly fast though.