[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:29:12 -0800

sorry i didnt read the second mail ( It came late to me) .. sincere appolo...

Actually the question was not clear ...

Thanks,
Manu

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

On 3/20/06, manu jose <[EMAIL PROTECTED]> wrote:
> 1) it says consecutive integers then how can you sort the array ?
if you read my first mail, I wrote: "if I understood correctly the problem",
that means: "maybe I'm wrong, maybe not, please give us some more
details".

>  2) How can u sort an array in O(logn) ???? it should be O(nlogn + L)
if you read my second mail, I wrote that it was a typo.

Maybe I'm wrong, nobody is perfect, but please, at least read _anything_
before answering. I think that here nobody needs to show his skills,
we just like to *try* to solve problems.

Thank you.




--
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 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