algorithm to find Best 8 minute window in a 1 hour run

Posted by Arun on Stack Overflow See other posts from Stack Overflow or by Arun
Published on 2010-05-01T17:13:33Z Indexed on 2010/05/01 17:17 UTC
Read the original article Hit count: 257

Filed under:
|

I have a requirement like, an activity runs for about more than an hour. I need to get the best 8 minute window where some parameters are maximum.

say a value x, which is dynamic for every second. if my activity runs for one hr,i get 3600 values for x. I need to find the best continuous 8 minute time interval where x value was the highest among all the others.

if i capture say from 0th minute to 8th minute, there may be another time frame like 0.4 to 8.4 where it was maximum. the granularity is one second. every second we need to consider. basically the peak 8 minute window where x was maximum.

please help me with the design

© Stack Overflow or respective owner

Related posts about design

Related posts about algorithm