Loading docs/basic/sort.md +1 −0 Original line number Diff line number Diff line Loading @@ -57,6 +57,7 @@ void bubble_sort() { ## Shell 排序 Shell 排序是以它的发明者命名的,也称为缩小增量排序法。Shell 排序对不相邻的记录进行比较和移动: 1.将待排序序列分为若干子序列(每个子序列的元素在原始数组中间距相同) 2.对这些子序列进行插入排序 3.减小每个子序列中元素之间的间距,重复上述过程直至间距减少为 1 Loading mkdocs.yml +8 −7 Original line number Diff line number Diff line Loading @@ -163,11 +163,12 @@ nav: - 线段树: ds/segment.md - 划分树: ds/dividing.md - 虚树: ds/virtual-tree.md - Size Balanced Tree: ds/sbt.md - 二叉搜索树: ds/bst.md - 平衡树: - 二叉搜索树简介: ds/bst.md - Treap: ds/treap.md - Splay: ds/splay.md - WBLT: ds/wblt.md - Size Balanced Tree: ds/sbt.md - AVL 树: ds/avl.md - 替罪羊树: ds/scapegoat.md - 树套树: Loading Loading
docs/basic/sort.md +1 −0 Original line number Diff line number Diff line Loading @@ -57,6 +57,7 @@ void bubble_sort() { ## Shell 排序 Shell 排序是以它的发明者命名的,也称为缩小增量排序法。Shell 排序对不相邻的记录进行比较和移动: 1.将待排序序列分为若干子序列(每个子序列的元素在原始数组中间距相同) 2.对这些子序列进行插入排序 3.减小每个子序列中元素之间的间距,重复上述过程直至间距减少为 1 Loading
mkdocs.yml +8 −7 Original line number Diff line number Diff line Loading @@ -163,11 +163,12 @@ nav: - 线段树: ds/segment.md - 划分树: ds/dividing.md - 虚树: ds/virtual-tree.md - Size Balanced Tree: ds/sbt.md - 二叉搜索树: ds/bst.md - 平衡树: - 二叉搜索树简介: ds/bst.md - Treap: ds/treap.md - Splay: ds/splay.md - WBLT: ds/wblt.md - Size Balanced Tree: ds/sbt.md - AVL 树: ds/avl.md - 替罪羊树: ds/scapegoat.md - 树套树: Loading