Sorting is so Much Neater

Sorting was introduced in Monday's lecture. For some students in CSC 148, this is somewhat review. It was interesting to see Danny compare sorting methods to a life example like srting a hand of cards. I never made the conection how similar the two were until seeing it in class. It just seemed natural before. Personally I would use insertion sort for a hand of cards. Something like merge sort would be odd, although equally affective.

I like how by fixing up some code, you can make sorting time in applications faster. This could be very usuful in large projects.

Note: An algorithm will never take 0 or less seconds. If it does, get that thing patented!

Note to self: Learn L'Hopital's Rle - I will come in handy when trying to find limits.