The effective algorithm for constant state detection in time series V 2.3.

The article introduces a simple and effective algorithm for constant state detection in the time series. The algorithm, based on the sliding window of variable length, finds all the sections of the time series which have length greater or equal than some given minimal length and have difference between maximal and minimal value in the section less or equal than some given value. It is shown that the computational complexity of the aforementioned algorithm is O(N log N), where N is the length of time series.