Posted by hussein on August 09, 2000 at 03:09:49:
In Reply to: HW19 posted by An on August 09, 2000 at 02:54:23:
: AS I know that the question 'f' in the worst case is O(N) as you said yesterday morning, but it is defferent in your solution now!!!!
i said in class that if there was a tail pointer it would be O(1) and if not it would be O(N) ... of course if you dont assume a tail pointer the latter case would apply ... depending on your assumptions, both answers can be correct (and i said that in class)
: Plus, question 'h' in the terxt book it says that merger sort is O(N * log2 N) at page 416. However, your solution is '[not assigned]'.
thats because i specifically said you were not to answer that question since we do not cover mergesort in 1044 or 1704 ... "not assigned" means you were not supposed to answer that question, and Pete will not grade it.
: And the most important question is I dont' know why I have got ZERO on this home work!! At least I have 7 right ones in this HW if I don't count on the ones above!!
relax ... theres no need to panic ... just email Pete and ask about it ...