Lijie Chen @wjmzbmr1 · 26 Jun 2026
Given a set of n points in d dimensions, the problems of finding the furthest pair and the closest pair require no explanation even to laymen. However, while finding the closest pair has a much more efficient algorithm,
183 573Views
201Likes
24Reposts
3Replies
5Quotes
0Bookmarks
Is that a lot?
0.17×vs this author's median1 097 790 views is typical
25Percentile for this authorof 4 recent posts
66.8×vs 10K–100K median2 747 views is typical
17.7× audienceReachviews ÷ followers
0.13%Engagement rateof viewers reacted