Sort the coding languages by applications. (#721)

docs/chapter_sorting/insertion_sort.md

@@ -19,10 +19,10 @@
 
 ![插入排序流程](insertion_sort.assets/insertion_sort_overview.png)
 
-=== "Java"
+=== "Python"
 
-    ```java title="insertion_sort.java"
-    [class]{insertion_sort}-[func]{insertionSort}
+    ```python title="insertion_sort.py"
+    [class]{}-[func]{insertion_sort}
     ```
 
 === "C++"
@@ -31,10 +31,16 @@
     [class]{}-[func]{insertionSort}
     ```
 
-=== "Python"
+=== "Java"
 
-    ```python title="insertion_sort.py"
-    [class]{}-[func]{insertion_sort}
+    ```java title="insertion_sort.java"
+    [class]{insertion_sort}-[func]{insertionSort}
+    ```
+
+=== "C#"
+
+    ```csharp title="insertion_sort.cs"
+    [class]{insertion_sort}-[func]{insertionSort}
     ```
 
 === "Go"
@@ -43,6 +49,12 @@
     [class]{}-[func]{insertionSort}
     ```
 
+=== "Swift"
+
+    ```swift title="insertion_sort.swift"
+    [class]{}-[func]{insertionSort}
+    ```
+
 === "JS"
 
     ```javascript title="insertion_sort.js"
@@ -55,30 +67,6 @@
     [class]{}-[func]{insertionSort}
     ```
 
-=== "C"
-
-    ```c title="insertion_sort.c"
-    [class]{}-[func]{insertionSort}
-    ```
-
-=== "C#"
-
-    ```csharp title="insertion_sort.cs"
-    [class]{insertion_sort}-[func]{insertionSort}
-    ```
-
-=== "Swift"
-
-    ```swift title="insertion_sort.swift"
-    [class]{}-[func]{insertionSort}
-    ```
-
-=== "Zig"
-
-    ```zig title="insertion_sort.zig"
-    [class]{}-[func]{insertionSort}
-    ```
-
 === "Dart"
 
     ```dart title="insertion_sort.dart"
@@ -91,6 +79,18 @@
     [class]{}-[func]{insertion_sort}
     ```
 
+=== "C"
+
+    ```c title="insertion_sort.c"
+    [class]{}-[func]{insertionSort}
+    ```
+
+=== "Zig"
+
+    ```zig title="insertion_sort.zig"
+    [class]{}-[func]{insertionSort}
+    ```
+
 ## 算法特性
 
 - **时间复杂度 $O(n^2)$、自适应排序**：最差情况下，每次插入操作分别需要循环 $n - 1$、$n-2$、$\dots$、$2$、$1$ 次，求和得到 $(n - 1) n / 2$ ，因此时间复杂度为 $O(n^2)$ 。在遇到有序数据时，插入操作会提前终止。当输入数组完全有序时，插入排序达到最佳时间复杂度 $O(n)$ 。