dynamical list problem

01042019, 08:51 AM
Post: #13




RE: dynamical list problem
Hello all,
I'm not shure if everybody (or more worse for me, that I understand everybody else right) understand right: The numbers in the list are distances between places. Of course it is possible to calculate for every time step (e. g. 1 second) a speed, but I want to have average value of speed let us say for 5 (meters). {1 2 1 3 2} > {{1 2 1 1} {2 1 2} {1 3 1} {3 2}} These four lists contain all a way of 5 meters, but with different times of walking: {1 2 1 1} needs 3 + 1/3 seconds v = 3/2 m/s {2 1 2} needs 2 + 2/3 seconds v = 15/8 m/s {1 3 1} needs 2 + 1/2 seconds v = 2 m/s {3 2} needs 2 seconds v = 5/2 m/s The fraction of seconds have their reason in the fourth value of the original list is a big one: 3 and that value can be divided in 1 + 2, 2 + 1. And that might be the solution I looked for: for every new value in the list, must be calculate how far I have to go back in the original list to get 5 m and then how many time steps it affords. Then the now speed value has to be compared with last maximum value. 

« Next Oldest  Next Newest »

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