Good ol’ sorts…. I like how these old topics keep showing up….its good to see that I have something to begin with…. And its not something totally new.
This is going exactly as my first blog had predicted… muahahahaha.
As soon as merge sort appeared on Danny’s slides… I thought to myself ….hey merge sort that’s the first program I wrote to understand recursion. Et voila! On the next slide Danny had used recursion to do his merge sort . In this lecture we basically learnt to uwind recursive statements sort of like what we did to get the output of certain recursions in CSC 148. But then we stuck to the induction structure and that brought us on track and the unwinding made a lot more sense. Once again a successful 236 lecture. :)
No comments:
Post a Comment