@coolfrog
in case of AB we asked to A know B after checking this we eliminate A n same
case go for CD den
A B CD
| |
AD
AD Same approach
|
D (D will be celebrity)
On Fri, Sep 24, 2010 at 10:57 AM, kartheek muthyala
wrote
@coolfrog,
What I meant by remained is
Considering your case of A,B,C,D and B is the celebrity,
The sequence is
First A,B ask the question to A, then remained=B
Then B,C ask the question to B, then remained=B
Then B,D ask the question to B, then remained= B
Then ask A,C,D whether they know B
Th
@ umesh kewat
suppose A,B,C,D and D is celebrity
A,B C,D
how would u eliminate one form A,B even if u can ... it will be order
of O(n logn) ...
Regards ...
Divesh
On Thu, Sep 23, 2010 at 4:00 AM, umesh kewat wrote:
> Use divide and conquer strategy of algorithm by diving in 2-2 g
Use divide and conquer strategy of algorithm by diving in 2-2 group like
merge sort make tree where every level we dropping people by using logic of
above post so root will be celebrity
On Thu, Sep 23, 2010 at 11:26 AM, kartheek muthyala
wrote:
> Take 2 persons, suppose say A and B
> ask one of t
is it not finding the articulation point in a graph ? => this has a linear
time solution.
if the edge exist TRUE otherwise FALSE, n x n adjacency matrix with 1/0
(TRUE/FALSE)
Thanks,
Sathaiah
On Wed, Sep 22, 2010 at 9:37 PM, Divesh Dixit <
dixit.coolfrog.div...@gmail.com> wrote:
> Among n peopl
@kartheek
i am getting. this prudent approach
but what is "add what remained to the remainder."
suppose u have A,B,C,D and B is celebrity ...
if( A knows B)
{ A is not celb.
if( B knows C){}
else{ C is not celb.
if (C knows B )
{ if(
And what if more than one person in that set?...let it be "c". so u
must ask ac+1(n-1) questions right?
On 9/23/10, Soundar wrote:
> isn't it supposed to be only O(n) questions.?
>
> On 9/23/10, santhosh wrote:
>> if the possibilty of a person knowing other any1 based circular linked..
>>
isn't it supposed to be only O(n) questions.?
On 9/23/10, santhosh wrote:
> if the possibilty of a person knowing other any1 based circular linked.. ie.
> 1/n..
> then none becomes celebrity .. so wat to do in tat situation??
>
> --
> You received this message because you are subscribed to t
if the possibilty of a person knowing other any1 based circular linked.. ie.
1/n..
then none becomes celebrity .. so wat to do in tat situation??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@g
Take 2 persons, suppose say A and B
ask one of them the question about other
if A Knows B, then A cannot be the celebrity,
if A does not know B, then B cannot be the celebrity.
add what remained to the remainder.
repeat this process for the remaining n-1 until one or none remained.
Then if it is
Among n people, a celebrity is defined as someone who is known to
everyone, but who knows no
one. Design and analyze to identify the celebrity, if one exists, by
asking only questions of the
following form: "Excuse me, do you know person x?" You will get a
binary answer for each such
question asked
http://www.4shared.com/
check it..
On Wed, Sep 22, 2010 at 12:00 AM, Nikhil Agarwal
wrote:
> Can anybody share his/her E-copy of An Introduction to algorithm by Udi
> manber.It's a great resource.If anybody has please share his E-copy.Thanks
> in advance.
>
> --
> Thanks & Regards
> Nikhil Agarw
hey ya man I was also searching for tat ione
, Sep 22, 2010 at 8:37 PM, Nikhil Agarwal wrote:
> @ankur Please give me a proper link.I mean with hash after 4shared.com
>
> On Wed, Sep 22, 2010 at 11:26 AM, ankur aggarwal > wrote:
>
>> http://www.4shared.com/
>> check it..
>>
>> On Wed, Sep 22,
@ankur Please give me a proper link.I mean with hash after 4shared.com
On Wed, Sep 22, 2010 at 11:26 AM, ankur aggarwal
wrote:
> http://www.4shared.com/
> check it..
>
> On Wed, Sep 22, 2010 at 12:00 AM, Nikhil Agarwal <
> nikhil.bhoja...@gmail.com> wrote:
>
>> Can anybody share his/her E-copy o
Can anybody share his/her E-copy of An Introduction to algorithm by Udi
manber.It's a great resource.If anybody has please share his E-copy.Thanks
in advance.
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
h
15 matches
Mail list logo
