by match u mean that number of fruits that overlap with i th fruit but are
not sliced before time i.
which means we have to consider 2^m cases where m is the maximum number of
fruits that overlap with ith fruit.
And this we have to do for each fruit.
On Mon, Jan 28, 2013 at 12:54 AM, Nikhil
Why do we use Fisher Yates
algorithmhttp://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#The_modern_algorithm
when
in the worst case there is no shuffle at all ?
we can modify it by generating random number not inclusive of the element
that we are about to swap
--
You received this
NO its not 2^m ,,, you have to use sorting technique .generally we t
do such sorting thing in time interval scheduling(standard greedy
problem).in case you didn,t understand let me know ...
On Monday, January 28, 2013 1:43:35 PM UTC+5:30, emmy wrote:
by match u mean that number of
Because then it's not a random shuffle? If you randomly shuffle something
the order you currently have should be just as likely as any other
On 28 January 2013 12:29, shady sinv...@gmail.com wrote:
Why do we use Fisher Yates
Dream teams are formed by television viewers by selecting five players from
the sixteen players namely
F1,F2,F3,F4,F5,F6,F7,F8,F9,F10,F11,F12,F13,F14,F15 and F16.The players
belong to exactly one of the three teams namely Chelsea,Liverpool and
United.Every Dream Team must have two players each
