Hi
I have a simmilar Problem , and was wondering if you can elaborate on
the funktion ,
sorry I am a starter and I need a bit more explainations ...
f(P1,P2, P3,...Pn) ,,,
How can I implement it in Java ,...
Thank you
Samuel
On 6 Jan., 08:10, Satish [EMAIL PROTECTED] wrote:
We can
Well, actually that only solves for when the # of players and events
are same, what if there're more players than events?
The recursion you describe has exponential growth rate. f(c) for some
set of P's can't really be cached, because the number of possible c's
is just are huge as exponential.
We can use dynamic programming here to find out the team configuration
with minimum time.
Define a function f(P1,P2, P3,...Pn) that returns the players sequence
(given n players for n rounds, which swimmer swims at which position)
that would return the total minimum time.
Then f() can be
At risk of stating the incredibly obvious, or giving away answer to a
fun interview question.
The naive but correct algorithm that gives the solution will have
tried every combination M of K swimmers in M events. which will give
you K!/(K-M)! arrangements, and the algorithm would then compare
