dynamical list problem

01022019, 06:47 PM
Post: #3




RE: dynamical list problem
I assume he wants to find the fastest mile/km during his run.
So if the running watch samples at a particular rate then n consecutive values will correspond to a mile/km. So find the n consecutive values that have the highest average; and note the starting position, p. p/n gives the mile/km position of the start of the fastest mile/km. Or something like that! 

« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)