dynamical list problem
|
01-03-2019, 12:57 PM
(This post was last modified: 01-03-2019 05:58 PM by Albert Chan.)
Post: #6
|
|||
|
|||
RE: dynamical list problem
Hi pier4r
(01-02-2019 04:36 PM)peacecalc Wrote: 4 {1 2 1 3} Now the first time for building an averge value: m = (4 + 1)/(3 + 1/3) = 3/2 The list are speed numbers, say miles run per hour (mph) So above translated to 4th hours {1 mph, 2 mph, 1 mph, 3 mph} 5-miles run "dynamic" part: Miles 0 to 5, time ~ 3+1/3 = 3.333 hr --> speed = 1.500 mph Miles 1 to 6, time ~ 2+2/3 = 2.667 hr --> speed = 1.875 mph Miles 2 to 7, time ~ 1.5+1 = 2.500 hr --> speed = 2.000 mph If above is what we wanted to calculate, it is better to record time for each mile: time = {0:00, 1:00, 1:30, 2:00, 3:00, 3:20, 3:40, 4:00, 4:30, 5:00} Assuming 0 based indexing, Miles k to 5+k, speed (mph) = 5/(time[k+5] - time[k]) |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)