Currently the algorithm linearly searches from end of burn time to end of sim time for the index that closest matches when landing occurred.
It would be really nice if a better algorithm, in terms of runtime (something that does not search though each index), if possible could be implemented.
Currently the algorithm linearly searches from end of burn time to end of sim time for the index that closest matches when landing occurred.
It would be really nice if a better algorithm, in terms of runtime (something that does not search though each index), if possible could be implemented.