|
|
Post by Tony on Apr 10, 2002 18:27:59 GMT -5
dominance of terms? eg. can we say n dominates log(n) thus to show log(n) + n is O(n), we can just show n is O(n) ?
|
|
|
|
Post by Observer on Apr 10, 2002 18:40:40 GMT -5
I would think so. I'm having a bit of troubling with the big O proof questions though. Not sure what the right way to write them is.
|
|
|
|
Post by Yingster on Apr 10, 2002 19:46:53 GMT -5
check out examples on slide 296 ^^
|
|
|
|
Post by Observer on Apr 10, 2002 22:24:36 GMT -5
You think we can write it that simply? It would only be a couple of lines for the whole question.
Also is #1 supposed to be really easy?
|
|
|
|
Post by Yingster on Apr 11, 2002 19:28:32 GMT -5
example's like that rite? so i dont see y not
ya, 1s easy ^^
|
|
|
|
Post by Observer on Apr 12, 2002 0:23:13 GMT -5
Btw we can only assume dominance in questions 7 and 8, and not in 5 I think. For 5 you have to use the properties of O Notation (I think most people figured that, else it would involve no work).
|
|
k
New Member
Posts: 2
|
Post by k on Apr 12, 2002 0:37:53 GMT -5
Why do we need to assume dominance for 7 & 8?  I just analyzed it by parts...? |
|
|
|
Post by Observer on Apr 12, 2002 1:05:16 GMT -5
Well I can't remember perhaps you don't have to since there's no choice here. Sometimes (like in some of the exampes in the books) theres an if followed by a loop and an else followed by another loop. If those two loops had different times then you'd pick the one wth higher order. I don't think you need that in this assignment. Anyway, I'm off to sleep.
|
|
