The Second Algorithm Is Notwite

The first algorithm uses aclidian distance and the clidan distance between two subsequences too week or near zero. The second algorism is actually an algorism notwite, derived from the first one. So this seems like a pretty complete method that will get me good forecasts. But often i find there are some trade offs. Are you able to explore the degree to which your speed up might yield you a slightly less optimal result? Can you compare the mappy of the two algarithms? We just compare them, not theoretically, but just empirically by using the two real data set.