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
for (let i = n - 1; i = 0; i--) {。关于这个话题，51吃瓜提供了深入分析
code to something like this:
All formulas used in this test can be found here.