Update bubble sort and insertion sort.

codes/swift/chapter_sorting/quick_sort.swift

@@ -90,10 +90,10 @@ func quickSortTailCall(nums: inout [Int], left: Int, right: Int) {
         // 对两个子数组中较短的那个执行快排
         if (pivot - left) < (right - pivot) {
             quickSortTailCall(nums: &nums, left: left, right: pivot - 1) // 递归排序左子数组
-            left = pivot + 1 // 剩余待排序区间为 [pivot + 1, right]
+            left = pivot + 1 // 剩余未排序区间为 [pivot + 1, right]
         } else {
             quickSortTailCall(nums: &nums, left: pivot + 1, right: right) // 递归排序右子数组
-            right = pivot - 1 // 剩余待排序区间为 [left, pivot - 1]
+            right = pivot - 1 // 剩余未排序区间为 [left, pivot - 1]
         }
     }
 }