On the week 6, we have covered the sections of merge sort and runnig time. This is the first topic that I found amusing, since these topics directly involves with programming languages. I found it very fun to track the codes down and derive a run-time formula from those codes.
Like some other algorithms (eg. trees), the merge sort also uses divide-and-conquer, in the application with the programming codes, It takes the unsorted list, and divide the list into two subcategories, sort them using recursion and put two lists back to one complete sorted array. I found it easier to understand than the trees, because proving trees varies every time, depending on their types, but the merge sorts, its proof structure seems remaining always the same, but the numbers.
I can't wait for the A2 to come out, because I feel very excited to learn these!
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment