Hello Rod here,
This week we started Big Oh and Big Omega. We started this week by being given a linear search algorithm. We began counting the how many times the code would execute based off of the length of the search. Afterwards we were given the algorithm for insertion sort. We counted the steps of each line of code relative the length of the all the elements in the list and afterwards wrote a proof that the upper bound of insertion sort is no bigger than n squared. We did the same proof for the lower bound of big omega.
I found this week pretty challenging. I barely could follow along during the lectures. So my plan is that i'm just going to do what i usually do and read the course notes and try to understand the concepts on my own time. When it came to counting the steps of whatever algorithm i found it pretty clear. I just need to work on my proofs of big oh and big omega.
No comments:
Post a Comment