On Jan 18, 2:57 pm, Peter Pawelko <ppawe...@student.cs.uwaterloo.ca> wrote: Question 3 asks "Prove or disprove ANY of the following..." Is this to read "...ALL of the following..." ? When I see "any", I figure I choose one of the items from the list a - e. But it's 25 marks so I'm assuming this is not the case. You should prove all the parts. --Reza

Question 3 asks "Prove or disprove ANY of the following..." Is this to read "...ALL of the following..." ? When I see "any", I figure I choose one of the items from the list a - e. But it's 25 marks so I'm assuming this is not the case.

... Manifying blib/man3/Net::DNS::Question.3 Manifying blib/man3/Net...blib/man3/POE::Filter::HTTPHead.3 Manifying blib/man3/POE::Filter...POE::Component::Client::HTTP::RequestFactory.3 Manifying blib/man3/POE::Component...HTTP::Request 1.40 1.3 HTTP::Response 1.53 1...configuration: Platform: osname=netbsd, osvers=3.1, archname=i386-netbsd-thread...

.../man3/Net::DNS::Resolver::Recurse.3 Manifying blib/man3/Net::DNS::...Manifying blib/man3/Net::DNS::Question.3 Manifying blib/man3/Net.../POE::Component::Client::HTTP::RequestFactory.3 Manifying blib/man3/POE::Component...HTTP::Request 1.40 1.3 HTTP::Response 1.53 1...configuration: Platform: osname=netbsd, osvers=3.1, archname=i386-netbsd-thread...

... 13, 6:13 pm, Martin <MartinK...@gmail.com> wrote: I'm confused about question 3. The solution really trivial: just take the sum of the K smallest elements in... not really. If you have numbers -1 -2 -3 and k = 2, so the smallest number we can get is ((-1)+(-2) ) + (-3) = -6 in your case, taking 2 smallest number would be -2 and -3 would would result a sum of -5

... 13, 6:13 pm, Martin <MartinK...@gmail.com> wrote: I'm confused about question 3. The solution really trivial: just take the sum of the K smallest elements .... If you have numbers -1 -2 -3 and k = 2, so the smallest number we can get is ((-1)+(-2) ) + (-3) = -6 in your case, taking 2 smallest number would be -2 and -3 would would result a sum of -5 Ah,...

Martin wrote: I'm confused about question 3. The solution really trivial: just take the sum of the K smallest elements in a (which can be done in O(n lg n) time)? What about a block size of 2 in [-5,2,-4,1,-3], the 2 smallest yields [[-5],[-4]] = -9 but the maximum is [[-5],[-4,1,-3]] = -11

On Jul 13, 6:13 pm, Martin <MartinK...@gmail.com> wrote: I'm confused about question 3. The solution really trivial: just take the sum of the K smallest elements in a (which can be done in O(n lg n) time)? Err.. "The solution _seems_ really trivial", I mean. Did you mean "maximizing"?

I'm confused about question 3. The solution really trivial: just take the sum of the K smallest elements in a (which can be done in O(n lg n) time)?

... Manifying blib/man3/Net::DNS::Question.3 Manifying blib/man3/Net::.............ok t/01-resolver..............ok 3/45 skipped: various reasons t/02-header................ok t/03-question..............ok t/04-packet-unique-...1.30 0 MIME::Base64 3.07 2.11 Net::IP... configuration: Platform: osname=netbsd, osvers=3.1, archname=i386-netbsd-thread...