Like the N-closest algorithm, the weight of each candidate is given by the inverse of its distance to the input colour. Because of this, both algorithms produce output of a similar quality, although the N-convex method is measurably faster. As with the last algorithm, more details can be found in the original paper[2].
Никита Абрамов (Редактор отдела «Россия»)
，这一点在搜狗输入法2026中也有详细论述
bytes. (And of course that lengthGuess is a correct guess for how
quality of the generated content may vary depending on the source material
if (arr[i] max) max = arr[i];