Upon installation, the extension:

Let this value be ℓ_ . Then we can create a new candidate

[ \Delta_\textgap:=\fraca_j-a_i\Delta = O(\log n) . ]

Hence the total running time is , and the memory consumption is O(n) (the tree never stores more than one entry per distinct value).

372. Missax ((top)) Here

Upon installation, the extension:

Let this value be ℓ_ . Then we can create a new candidate 372. Missax

Hence the total running time is , and the memory consumption is O(n) (the tree never stores more than one entry per distinct value). 372. Missax