HW19

[ Follow Ups ] [ Post Followup ] [ CS1704 Discussion WWWBoard ] [ FAQ ]

Posted by An on August 09, 2000 at 02:54:23:

Hi!
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!!!!and I did not see anything to say that the tail pointer was provided. It just say in the worst case!!!!
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]'.

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!!
Can you, Pete, please check!!!!
Thanks, An Nguyen

a.O(N)
b.O(N)
c.O(N)
d.O(N)
e.O(1)
f.O(1), provided there is a tail pointer
g.O(Log N)
h.[not assigned]
i.O(1)
j.O(1)

Follow Ups:

Re: HW19 Pete 08:10:34 08/09/00 (0)
Re: HW19 hussein 03:09:49 08/09/00 (1)
- Thanks An 03:13:26 08/09/00 (0)

Post a Followup

Name:
E-Mail:

Subject:

Comments:
: Hi! : 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!!!!and I did not see anything to say that the tail pointer was provided. It just say in the worst case!!!! : 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]'. : 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!! : Can you, Pete, please check!!!! : Thanks, An Nguyen : a.O(N) : b.O(N) : c.O(N) : d.O(N) : e.O(1) : f.O(1), provided there is a tail pointer : g.O(Log N) : h.[not assigned] : i.O(1) : j.O(1)

Optional Link URL:
Link Title:
Optional Image URL:

[ Follow Ups ] [ Post Followup ] [ CS1704 Discussion WWWBoard ] [ FAQ ]