@Swapnil I got a counter example for my approach.By O(8) i mean O(c) c: a
constant leading to O(1).
On Tue, Dec 21, 2010 at 2:10 AM, Saurabh Koar saurabhkoar...@gmail.comwrote:
@yq: Can u plzz inform what was ur approach/logic while deriving the
condition that index will be increased of that
I have a solution.I cant prove the correctness but by intuition I can
conclude.This is O(1) solution.
As we have 3 sorted arrays A,B,C.So only first and last element of
these 3 lists will be contributing for min/max tuple.Rest elements
will be varying from that max to min.
Suppose a={-1,-1,0}
@Saurabh: This response is pretty surly for someone asking for free
help.
Dave
On Dec 19, 11:51 pm, Saurabh Koar saurabhkoar...@gmail.com wrote:
@yq: Heyy yq..I m not interested in what is equivalent to what and
what is not not equivalent to what..I m interested to a specific
optimized
@Dave : Ya I understand.Thank u.
@yq: Sorry!! :(
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
@davesaura， i dont understand what did you mean.
Sent from Nexus one
On Dec 20, 2010 6:13 AM, Saurabh Koar saurabhkoar...@gmail.com wrote:
@Dave : Ya I understand.Thank u.
@yq: Sorry!! :(
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
@Nikhil - Not sure on what you mean by O(8). And O(1) doesn't work
anyway.
-Swapnil
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
@yq: Can u plzz inform what was ur approach/logic while deriving the
condition that index will be increased of that array which contains
minimum of three elements to get the desired ans?
It will be very helpful.Thanks in advance.
--
You received this message because you are subscribed to the
