Week 7

This week, I finally understood materials that I didn't fully understand from last week under the helps of my tutor. I learned about sorting, worst case, upper bound, and lower bound. I knew that as a programer, I want to find the worst case/speed of a program. Upper bound meant the case that can't be any worse than it. Lower bound meant the case that was the least worst. That's being said if the shorter the running time of a program was, meaning that more efficient the program was for computer (device) to run; therefore, a better performance. Moreover, the running time depended on how long the program required to count all of its steps. Furthermore, an example of worst case complexity graph was shown below.

The function y = x  represented the given input of the program.
The function y = logx + 1 represented the lower bound (at least as bad) of the program (least time consuming)
The function y = x^3 + x^2 - 1 represented the upper bound (can't get any worse) of the program (most time consuming)

 

 Additionally, we mentioned introduction rules, insertion sort, and selection sort.

We found that steps required for insertion sort and selection sort on list of size n were no more than some quadratic functions of n. All quadratic formulas were varied from substantial constant factors, but we as computer scientists didn't care because all quadratic formulas were the "same" - they were all in O(n^2). 

**** Big Oh stood for upper case and Big Omega stood for lower case ****