Nice. Finished the first question about sorting. As expected, some questions trip me. There are two reasons, 1 is that the implementation of the lecture could be different from mine. So I need to study the algorithm a bit before I can decide. Second is that some algorithm is intrinsically tricky to think through. For example, quicksort and mergesort are two sorts which take some serious time to consider.
But oh well, this is nice because it gives me some insight to some existing sorts which I thought I know (such as selection, insertion, bubble) and some new sort (such as quicksort and radixsort).
No comments:
Post a Comment