feat: add csharp solutions to lcof problems (doocs#826)

* 《剑指 Offer（第 2 版）》添加 C# 题解

Author: xiongbinzou

basic/sorting/BubbleSort/README.md

@@ -238,6 +238,37 @@ public class Program
 }
 ```
 
+### **Python3**
+
+```python
+def bubbleSort(arr):
+    n = len(arr)
+    # Iterate over all array elements
+    for i in range(n):
+        # Last i elements are already in place
+        for j in range(n - i - 1):
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]
+
+
+# 改进版本
+def bubbleSort(arr):
+    n = len(arr)
+    for i in range(n - 1):
+        has_change = False
+        for j in range(n - i - 1):
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]
+                has_change = True
+        if not has_change:
+            break
+
+
+arr = [64, 34, 25, 12, 22, 11, 90]
+bubbleSort(arr)
+print(arr)
+```
+
 <!-- tabs:end -->
 
 ## 算法分析

basic/sorting/InsertionSort/README.md

@@ -197,6 +197,22 @@ public class Program
 }
 ```
 
+### **Python3**
+
+```python
+def insertion_sort(array):
+    for i in range(len(array)):
+        cur_index = i
+        while array[cur_index - 1] > array[cur_index] and cur_index - 1 >= 0:
+            array[cur_index], array[cur_index - 1] = array[cur_index - 1], array[cur_index]
+            cur_index -= 1
+    return array
+
+array = [10, 17, 50, 7, 30, 24, 27, 45, 15, 5, 36, 21]
+print(insertion_sort(array))
+
+```
+
 <!-- tabs:end -->
 
 ## 算法分析