增加“排序”

Author: diguage

docs/.asciidoctorconfig

@@ -12,6 +12,7 @@
 
 :sourcedir: {asciidoctorconfigdir}/../src/main/java/com/diguage/algo/leetcode
 :labdir: {asciidoctorconfigdir}/../src/test/java/com/diguage/labs
+:sortdir: {asciidoctorconfigdir}/../src/main/java/com/diguage/algo/sort
 :java_src_attr: source%nowrap,java,indent=0,linenums,subs="attributes,verbatim,quotes"
 
 :doc_base_url: {asciidoctorconfigdir}/../docs

docs/0000-bubble-sort.adoc

@@ -0,0 +1,5 @@
+[#0000-bubble-sort]
+= 冒泡排序
+
+image::images/bubble-sort-overview.png[{image_attr}]
+

docs/0000-bucket-sort.adoc

@@ -0,0 +1,6 @@
+[#0000-bucket-sort]
+= 桶排序
+
+image::images/bucket-sort-overview.png[{image_attr}]
+
+

docs/0000-counting-sort.adoc

@@ -0,0 +1,5 @@
+[#0000-counting-sort]
+= 计数排序
+
+
+image::images/counting-sort-overview.png[{image_attr}]

docs/0000-heap-sort.adoc

@@ -0,0 +1,5 @@
+[#0000-heap-sort]
+= 堆排序
+
+
+

docs/0000-insertion-sort.adoc

@@ -0,0 +1,5 @@
+[#0000-insertion-sort]
+= 插入排序
+
+image::images/insertion-sort-overview.png[{image_attr}]
+

docs/0000-merge-sort.adoc

@@ -0,0 +1,5 @@
+[#0000-merge-sort]
+= 归并排序
+
+
+

docs/0000-quick-sort.adoc

@@ -0,0 +1,5 @@
+[#0000-quick-sort]
+= 快速排序
+
+
+image::images/quick-sort-overview.png[{image_attr}]

docs/0000-radix-sort.adoc

@@ -0,0 +1,16 @@
+[#0000-radix-sort]
+= 基数排序
+
+基数排序通过从低位到高位，对数字的每一位进行排序来获得排序结果。比较适合数量不多，但是每个数字之间相差很大的情况。而且时间复杂度是 stem:[O(nk)]，`n` 表示数量， `k` 表示最大位数。
+
+image::images/radix-sort-overview.png[{image_attr}]
+
+[{java_src_attr}]
+----
+include::{sortdir}/RadixSort.java[tag=answer]
+----
+
+
+== 经典题目
+
+xref:0164-maximum-gap.adoc[164. 最大间距]

docs/0000-selection-sort.adoc

@@ -0,0 +1,5 @@
+[#0000-selection-sort]
+= 选择排序
+
+
+

docs/0000-shell-sort.adoc

@@ -0,0 +1,14 @@
+[#0000-shell-sort]
+= 希尔排序
+
+image::images/shell-sort-00.gif[{image_attr}]
+
+TIP: 这个动图第一步很好！后面不好！
+
+image::images/shell-sort-01.png[{image_attr}]
+
+image::images/shell-sort-02.png[{image_attr}]
+
+image::images/shell-sort-03.png[{image_attr}]
+
+image::images/shell-sort-04.gif[{image_attr}]

docs/0000-sort.adoc

@@ -0,0 +1,34 @@
+[#0000-sort]
+= 排序
+
+include::0000-selection-sort.adoc[leveloffset=+1]
+
+include::0000-bubble-sort.adoc[leveloffset=+1]
+
+include::0000-insertion-sort.adoc[leveloffset=+1]
+
+include::0000-quick-sort.adoc[leveloffset=+1]
+
+include::0000-merge-sort.adoc[leveloffset=+1]
+
+include::0000-shell-sort.adoc[leveloffset=+1]
+
+include::0000-heap-sort.adoc[leveloffset=+1]
+
+include::0000-bucket-sort.adoc[leveloffset=+1]
+
+include::0000-counting-sort.adoc[leveloffset=+1]
+
+include::0000-radix-sort.adoc[leveloffset=+1]
+
+== 参考资料
+
+. https://www.hello-algo.com/chapter_sorting/bubble_sort/[11.3   冒泡排序 - Hello 算法^]
+. https://www.hello-algo.com/chapter_sorting/insertion_sort/[11.4   插入排序 - Hello 算法^]
+. https://www.hello-algo.com/chapter_sorting/quick_sort/[11.5   快速排序 - Hello 算法^]
+. https://www.hello-algo.com/chapter_sorting/bucket_sort/[11.8 桶排序 - Hello 算法^]
+. https://www.hello-algo.com/chapter_sorting/counting_sort/[11.9 计数排序 - Hello 算法^]
+. https://www.hello-algo.com/chapter_sorting/radix_sort/[11.10 基数排序 - Hello 算法^]
+. https://zh.wikipedia.org/wiki/%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8F[希尔排序 - 维基百科^]
+. https://blog.csdn.net/m0_70103775/article/details/127894920[希尔排序（动图+详解）^]
+. https://www.cnblogs.com/the3times/p/12547787.html[希尔排序^]

docs/images/bubble-sort-overview.png

@@ -23,6 +23,8 @@ include::0000-data-structure-heap.adoc[leveloffset=+1]
 
 include::0000-data-structure-graph.adoc[leveloffset=+1]
 
+include::0000-sort.adoc[leveloffset=+1]
+
 // Pattern
 
 include::0000-00-recursion.adoc[leveloffset=+1]

docs/images/bucket-sort-overview.png

@@ -835,6 +835,7 @@
               <sourceDocumentName>index.adoc</sourceDocumentName>
               <attributes>
                 <sourcedir>${project.build.sourceDirectory}/com/diguage/algo/leetcode</sourcedir>
+                <sortdir>${project.build.sourceDirectory}/com/diguage/algo/sort</sortdir>
                 <labdir>${project.build.testSourceDirectory}/com/diguage/labs</labdir>
                 <basedir>${project.basedir}</basedir>
                 <doctype>book</doctype>

docs/images/counting-sort-overview.png

@@ -0,0 +1,50 @@
+package com.diguage.algo.sort;
+
+import java.util.Arrays;
+
+public class RadixSort {
+  // tag::answer[]
+  /**
+   * 基数排序
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-06-29 15:45:01
+   */
+  public void radixSort(int[] array) {
+    if (null == array || array.length < 2) {
+      return;
+    }
+    int max = Arrays.stream(array).max().orElse(0);
+    int length = array.length;
+    for (int exp = 1; exp < max; exp *= 10) {
+      int[] counter = new int[10];
+      for (int num : array) {
+        // 获取指定位的值
+        int digit = (num / exp) % 10;
+        counter[digit]++;
+      }
+      // 将数量从小向大汇总，
+      // 稍作处理即可映射出每个数字应该存储的坐标
+      for (int i = 1; i < 10; i++) {
+        counter[i] += counter[i - 1];
+      }
+      // 存储临时结果
+      int[] temp = new int[length];
+      for (int i = length - 1; i >= 0; i--) {
+        int digit = (array[i] / exp) % 10;
+        // counter[digit] 是一个数量统计，-1 是指向应该存储的坐标
+        int index = counter[digit] - 1;
+        temp[index] = array[i];
+        counter[digit]--;
+      }
+      for (int i = 0; i < length; i++) {
+        array[i] = temp[i];
+      }
+    }
+  }
+
+  // end::answer[]
+  public static void main(String[] args) {
+    new RadixSort().radixSort(new int[]{3, 6, 9, 1});
+  }
+}