Intersection algorithm

It forms part of the modern Network Time Protocol.

[1][2] While Marzullo's algorithm will return the smallest interval consistent with the largest number of sources, the [1]returned interval does not necessarily include the center point (calculated offset) of all the sources in the intersection.

The best estimate is that which assumes the fewest falsetickers, f. The results will be considered valid if f < M/2, otherwise the algorithm will return failure instead of an interval.

The intersection algorithm begins by creating a table of tuples .

Variables: This algorithm uses f as number of false tickers, endcount and midcount are integers.