SLOG Entry #8

     Here's my weekly SLOG entry. This week, in computer science, we covered some questions about assignment two and learned some new sorts. The sorts we learned were quick sort and merge sort. In quick sort, a pivot is chosen, the list is sorted around the pivot and then each new partition is then also quick sorted. In merge sort, the list is divided in half, each half is merge sorted and then the two halves are joined together. These sorts are more complicated then the sorts we learned before, but they are also quicker and more efficient, as shown when we calculated their big-ohs. Check in next week for more computer science!