For instance,
claim: n^3 not in O(3n^2)
From first glance, it is obvious that n^3 will not be bounded by 3n^2 since it is obvious that n^3 will grow much quicker than n^2, and the 3 multiplier can be ignore as it will not matter too much as the numbers grows toward infinity.
To prove the claim, simply prove the negation of that n^3 is in big O of 3n^2 by choosing a breakpoint, by which n^3 will grows bigger than 3n^2.
Through the weeks, a new problem was introduced. The problem abruptly increases the complexity in proving Big oh. The problem is to prove a claim that compares two functions that is beyond polynomials. Therefore, it includes other functions like 2^n.
Well, for each new enemy, there is always a new weapon. Time to bring out the new weapon: the limit technique. The mechanics allow me to tackle the enemy in a completely new way.
Taking this claim as an example:
2^n is not in O(n^2)
To approach the problem, I first express the claim as an limit that as n goes to infinity 2^n/ n^2. By using L.Hopital's rule, The limit evaluates to infinity. Then I am safe to state that if I choose an nc to defeat the c that the enemy hands me and defeat the problem.
In addition to the week, I struggled upon the introduction of Big Omega. It differs only letter from Big oh as it allows me to choose a breakpoint -B- in which allow the claim to be true. However, that big difference took a way a large chunk of time. To fully understand the concept of the Big omega and its difference with Big oh, I used graphing calculators to interpret different graphs. It definitely helped as I can visualize the easier function and understand how Big omega is applied to it.
Well, for each new enemy, there is always a new weapon. Time to bring out the new weapon: the limit technique. The mechanics allow me to tackle the enemy in a completely new way.
Taking this claim as an example:
2^n is not in O(n^2)
To approach the problem, I first express the claim as an limit that as n goes to infinity 2^n/ n^2. By using L.Hopital's rule, The limit evaluates to infinity. Then I am safe to state that if I choose an nc to defeat the c that the enemy hands me and defeat the problem.
In addition to the week, I struggled upon the introduction of Big Omega. It differs only letter from Big oh as it allows me to choose a breakpoint -B- in which allow the claim to be true. However, that big difference took a way a large chunk of time. To fully understand the concept of the Big omega and its difference with Big oh, I used graphing calculators to interpret different graphs. It definitely helped as I can visualize the easier function and understand how Big omega is applied to it.
Wow! You wrote so long this time! I also find Big-Oh question very challenging. It is always a good idea to start with the definition. When we say a function is grow faster or slower, we are actually implies the rate of growth. Therefore, I recommend you to use limit in this problem. You can find a break point by setting derivatives of both equation to be equal or use techniques to create a graph.It is more obvious to see answers from the graph. Hope you find this helpful!
回复删除