week10

The topic of this week’s lecture was about sorting. In csc108, I learned about selection sort, insert sort, bubble sort. Every ways of sorting has its own features, some of them are efficient. This week I learned quick sort and merge sort, and both of them use recursion. The complexity of each method is different. it's my first time that knowing big oh. it tells us the growth rate.

The lab of this week was about inorder traversal and the longest path. When I did these two functions, I used helper function to make implement easier. After drawing binary trees and discussing, we finished this lab quickly. Recursion is our friend. It makes our functions easy to understand.