-- Forwarded message --
From: Christi Massey masseychri...@gmail.com
Date: Thu, Sep 30, 2010 at 9:03 AM
Subject:
To: algogeeks@googlegroups.com
Q.Assume you have an array A[1:n] of n elements.A majority element of a is
any element occuring in more than n/2 positions(so if n=6
-- Forwarded message --
From: Christi Massey masseychri...@gmail.com
Date: Thu, Sep 30, 2010 at 9:54 AM
Subject:
To: algogeeks@googlegroups.com
Q.Can you give the optimal solution to the knapsack instances n=7,
m=15,(p1,p2..p7) = (10,5,15,7,6,18,3) and
(w1,w2.w7
hi,
can anybody plz tell me how to find the space and time complexity of an
algorithm in better and short way with example?
and
how we find that which approach should be applied to a problem so that we
will get its optimized solution with less complexity?
--
You received this message because
Q.Assume you have an array A[1:n] of n elements.A majority element of a is
any element occuring in more than n/2 positions(so if n=6 or n=7, any
majority element will occur in at least 4 positions).assume that elements
cannot be ordered or sorted, but can be compared for equality.(you might
think
Q.an n-vertex graph is a scorpion if it has a vertex of degree one(the
sting)connected to a vertex of degree two(the tail) connected a vertex of
degree n-2(the body) connected to the other n-3 (the feet). some of the feet
may be connected to other feet. Design an algorithm that decides whether a
Q.Can you give the optimal solution to the knapsack instances n=7,
m=15,(p1,p2..p7) = (10,5,15,7,6,18,3) and
(w1,w2.w7)=(2,3,5,7,1,4,1)?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
A table composed of N*M cells,each having a certain quantity of apples, is
given. you start from the upper-left corner. At each step you can go down or
right one cell.Design an algorithm to find the maximum number of apples you
can collect ,if you are moving from upper-left corner to bottom-right
will you plz explain this problen in detail.if possible by designing its
algorithm
--
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
