week # 10

We continued on Sort big-oh in week 10.  I got basic concepts of sorting(selection sort and insertion sort) and running time analysis last week, although I did not really understand them. In the lecture, prof Heap introduced quick sort and merge sort.
The idea of quick sort is to choose a pivot element, then decide where the pivot goes with respect to the rest of the list, repeat on the partitions. The idea of merge sort is to divide the list in half, merge sort the halves, then merge sort the sorted results. I understand well on the methods of sorting, but big-oh(running time). I have trouble analying the performance of different types of sorting, but I think I can figure it out soon.