Week 10

This week we talked about Sorting, first we have Selection sort and Insertion sort, but these two sorting method are both slow sort since they both have O(n^2) which means they have to repeat the function in extremly lots of times, so we need to find another way which is quick sort with O(n lg n).
Assignment 2 is nicely done, the most time I spent is on 1st function, after I figured out what kind of thinking way I should go with, the rest of function becomes pretty easy since they really works in the similar way, I expect my assignment can recover my marks droped from midterm test.