This week was a little rough, in terms of understanding the content. It was mainly focused on the efficiency of insertion sort and calculating the worst case scenario of inputting a value for an insertion sort. This sort is constructed with a set of "while" loops. At that point, I was not clear with the upper and lower bound of a worst case scenario. Hopefully, the course notes will provide an explanation regarding this part of the lecture. As for the rest of the content, it was easy to understand. The O(n^2) is simply a set of functions that returns positive real numbers by inputting natural numbers. This is necessary to determine the worst case scenario of insertion sort.
In other news, Assignment 2 for this course is nearly complete. It was a little difficult, but it was convenient because it provided preparation for the second term test. Hopefully, results are improved compared to the first assignment, but I think a little more practice wouldn't hurt.
No comments:
Post a Comment