A Very Efficient Algorithm for Calculating the Max and Min from Running Data

Rushabh Sharadchandra Sankalcar

Abstract: I present an algorithm for calculating the running maximum and minimum value of a one-dimensional sequence over a sliding window. The above-mentioned algorithm stores an ordered list of data elements which may have the potential to become maxima or minima across the data window at some future time instant. This algorithm has a number of advantages over competing algorithms like reducing processing time and storage requirements for long data windows. It also finds the minimum and maximum at the same time with minimum number of comparisons. It is observed that by using this new algorithm the number of comparisons reduces drastically in finding maximum and minimum value of a one-dimensional sequence.

Keywords: Running sequence, maximum, minimum, effective algorithm, MINMAX, MAXLIST, comparisons