void shellSort(int arr[], int n) {
https://feedx.site
，这一点在一键获取谷歌浏览器下载中也有详细论述
输入：nums = [2,6,4,8,10,9,15]，详情可参考Line官方版本下载
We wanted a scenario where, say, 5 well-placed border points could efficiently represent an area with 5,000 internal points and 10,000 road edges. This would reduce those 10,000 edges to just 5*4/2 = 10 shortcuts for routing through that cluster at a high level – an incredible 1:1000 point ratio and a 30x reduction in edges to consider for the high-level path!