Dean of Computer Science department wants to keep the motivation
levels of students of data structure course high by giving incentives.
He has suggested that after the second minor the top lon students be
distributed samosas and the next sqrt(n) students be given gulab
jamuns. However, he has
you can sort the students list according to marks in o(n) time by using
RADIX SORT.
On 3/14/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
Dean of Computer Science department wants to keep the motivation
levels of students of data structure course high by giving incentives.
He has suggested
On 3/14/07, Arun [EMAIL PROTECTED] wrote:
there are some N robots in a field and the physical orientation is known(
i.e thier location/distance-with-others). a robot can send a message at a
given time only to 3 of them.
you have a source robot and u have a message from this source which is to
Hmmm
I think this is exactly the same problem(where k is generailsed) which is(as
they claim) NP hard.
Any ideas on the second version where the goal is to minimise the
duplication of node visits. Probably some combination of dfs and bfs mite be
help(directly or annotating the nodes with
On Mar 14, 5:43 pm, Rajiv Mathews [EMAIL PROTECTED] wrote:
On 3/14/07, NUPUL [EMAIL PROTECTED] wrote:
Firstly your problem is not out of the blue...it's an enquiry for an
existence of such an algorithm. Secondly, a good deal of research has
gone into finding algorithms with O(n)
