Is this the same problem as:
http://groups.google.com/group/algogeeks/browse_frm/thread/26c31cc2530a88e1#
?
Or can the teams have different numbers of players?
On May 30, 2:28 pm, Veer Sharma wrote:
> Hi Friends,
>
> This is my first post to this forum. A "Hi" to all of you and here is
> my fi
@abhishek:i meant after sorting split the array into 2 part each with equal
sum
On Sun, May 30, 2010 at 11:45 PM, Abhishek Sharma wrote:
> @sharad: if you find the subarrays of equal sum then the number of players
> might differ in the team... also can you tell me how will you do
> that..acc
Correction: Team2:7, 10, 11, 12, 15
On Sun, May 30, 2010 at 11:45 PM, Abhishek Sharma wrote:
> @sharad: if you find the subarrays of equal sum then the number of players
> might differ in the team... also can you tell me how will you do
> that..according to me time cmoplexity will be higher..
@sharad: if you find the subarrays of equal sum then the number of players
might differ in the team... also can you tell me how will you do
that..according to me time cmoplexity will be higher..
According to me:
sort the palyers based on skill points (O(nlogn) --mergesort) then assign
the players
http://www.marav2703.my3gb.com
--
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
algogeeks+unsubscr...@googlegroups.com.
For more op
sort the players based on skill point and get the subarray of equal
sum..
On Sun, May 30, 2010 at 6:58 PM, Veer Sharma wrote:
> Hi Friends,
>
> This is my first post to this forum. A "Hi" to all of you and here is
> my first problem...
>
> Giiven int n, the total number of players and their s
Hi Friends,
This is my first post to this forum. A "Hi" to all of you and here is
my first problem...
Giiven int n, the total number of players and their skill-point.
Distribute the players on 2 evenly balanced teams.
Lets see who gives the best solution (least space complexity / least
time comp