#Week 10
We devoted a lot of time this week to working on the 2nd assignment. It definitely looked a lot more easier than we anticipated, however I feel like our group really pulled together and worked really hard on the assignment. Eventually with quite a lot of help from the drop in centre and a lot of sleepless nights I feel like we conquered the assignment.
Other than that we talked about and focused on recursion efficiency this week in the lectures along with the introduction to the Big Oh. We’ve considered several different types of sort, that include insertion sort, bubble sort, selection sort, quick sort and merge sort. They are all useful to sort in different ways however the important factor is the efficiency of each of them; which is measured by the highest order of the variable that effects the outcome. For example, n, the length of a list. When the order of a program’s big-Oh is larger, its runtime will rise more dramatically for a bigger n. The concept is rather easy to grasp and I’ve been following through well till now. Hope to continue this way.
