for i in intervals:
    dt = (times[i] - times[0]) / i
index = int((target - start) / dt)
print('    %6i  %8i  %8i  %.10f' % (i, actual_index, index, dt))
Can I make an O(1) search algorithm using a sorted array with a known step?