[algogeeks] Re: How to find, efficiently, the maximum sum of atleast L consecutive integers from a sequence of N integers.

Mon, 20 Mar 2006 05:09:48 -0800

1) it says consecutive integers then how can you sort the array ?

2) How can u sort an array in O(logn) ???? it should be O(nlogn + L)

On 3/20/06, Mattia Merzi <[EMAIL PROTECTED] > wrote:

On 3/20/06, vb <[EMAIL PROTECTED] > wrote:
> How can we find the the maximum sum of atleast L consecutive integers
> given a sequence of N integers.
if I understood correctly the problem, just sort the array
and take the first L integers. This requires O(log(n)+L).


--
Manu Jose,
mob :09844467453
E-mail : [EMAIL PROTECTED]
-------------------------------------------------
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected]
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