Table A1.

The algorithm time complexity analysis: $T_n$—measured in terms of the number of representative operations needed to solve Equation (14)—for different sizes (n) of the test streams ($f_1$, $f_2$, $f_3$, and $f_4$).

$\mathit{n}\times {10}^3$	${\mathit{T}}_{\mathit{n}}$ for ${\mathit{f}}_1$	${\mathit{T}}_{\mathit{n}}$ for ${\mathit{f}}_2$	${\mathit{T}}_{\mathit{n}}$ for ${\mathit{f}}_3$	${\mathit{T}}_{\mathit{n}}$ for ${\mathit{f}}_4$
10	1,943,679	2,046,967	2,025,182	2,033,942
50	9,860,670	10,791,466	10,472,338	10,535,740
100	19,933,179	21,144,273	21,093,559	21,050,965
250	50,373,800	53,515,682	53,311,644	52,439,474
500	100,428,803	106,829,071	106,302,366	104,768,087
750	150,522,546	160,678,013	159,405,423	157,300,544
1000	200,772,538	213,827,730	212,596,453	209,684,704