[algogeeks] Re: Subset with largest sum

Wed, 05 Apr 2006 07:48:48 -0700

I think it it max sub-sequence problem which is discussed on this link : http://discuss.fogcreek.com/techinterview/default.asp?cmd=show&ixPost=3052
 


 
On 4/5/06, Vijendra Singh <[EMAIL PROTECTED]> wrote:
I dont get it, if its just the subset, then just get the sum of all positive nos. may be you wanted continous nos.

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







Indian Institute of Technology, Kharagpur.
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---

Reply via email to