another variation of the question can be, find the subset where (sum of subset)/(max element of the set) is maximum.
Lets discuss this as well :)
Thanks,
Vijendra
On 4/5/06, shishir <[EMAIL PROTECTED]
> wrote:
Hi,
This is a standard MS interview question.
Give an O(n) algorithm to find the subset of an array A[n] with largest
sum.
Anticipating a healthy and useful discussion on this.
Thanks,
Shishir
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---