Chapter 03 section 07 comments updated.

liuyubobobo · liuyubobobo · commit 0d88d218a39a · 2019-01-12T16:48:12.000-08:00
diff --git a/.gitignore b/.gitignore
@@ -19,6 +19,7 @@ Thumbs.db
 #####################
 *.gch
 *.out
+cmake-build-debug/
 
 ##########################
 # Jetbrains Ignore files #
diff --git a/03-Sorting-Advance/Course Code (C++)/07-Quick-Sort-Deal-With-Identical-Keys/main.cpp b/03-Sorting-Advance/Course Code (C++)/07-Quick-Sort-Deal-With-Identical-Keys/main.cpp
@@ -30,7 +30,8 @@ int _partition(T arr[], int l, int r){
 }
 
 // 双路快速排序的partition
-// 返回p, 使得arr[l...p-1] < arr[p] ; arr[p+1...r] > arr[p]
+// 返回p, 使得arr[l...p-1] <= arr[p] ; arr[p+1...r] >= arr[p]
+// 双路快排处理的元素正好等于arr[p]的时候要注意，详见下面的注释：）
 template <typename T>
 int _partition2(T arr[], int l, int r){
 
diff --git a/03-Sorting-Advance/Course Code (Java)/07-Quick-Sort-Deal-With-Identical-Keys/src/bobo/algo/QuickSort2Ways.java b/03-Sorting-Advance/Course Code (Java)/07-Quick-Sort-Deal-With-Identical-Keys/src/bobo/algo/QuickSort2Ways.java
@@ -8,7 +8,8 @@ public class QuickSort2Ways {
     private QuickSort2Ways(){}
 
     // 双路快速排序的partition
-    // 返回p, 使得arr[l...p-1] < arr[p] ; arr[p+1...r] > arr[p]
+    // 返回p, 使得arr[l...p-1] <= arr[p] ; arr[p+1...r] >= arr[p]
+    // 双路快排处理的元素正好等于arr[p]的时候要注意，详见下面的注释：）
     private static int partition(Comparable[] arr, int l, int r){
 
         // 随机在arr[l...r]的范围中, 选择一个数值作为标定点pivot
diff --git a/03-Sorting-Advance/Course Code (Java)/Optional-04-Inversion-Number/src/bobo/algo/InversionCount.java b/03-Sorting-Advance/Course Code (Java)/Optional-04-Inversion-Number/src/bobo/algo/InversionCount.java
@@ -68,7 +68,7 @@ public static long solve(Comparable[] arr){
     // 测试 InversionCount
     public static void main(String[] args) {
 
-        int N = 1000000;
+        int N = 5;
 
         // 测试1: 测试随机数组
         Integer[] arr = SortTestHelper.generateRandomArray(N, 0, 100000);

Original file line number	Diff line number	Diff line change
`@@ -30,7 +30,8 @@ int _partition(T arr[], int l, int r){`
`30`	`30`	`}`
`31`	`31`
`32`	`32`	`// 双路快速排序的partition`
`33`		`-// 返回p, 使得arr[l...p-1] < arr[p] ; arr[p+1...r] > arr[p]`
	`33`	`+// 返回p, 使得arr[l...p-1] <= arr[p] ; arr[p+1...r] >= arr[p]`
	`34`	`+// 双路快排处理的元素正好等于arr[p]的时候要注意，详见下面的注释：）`
`34`	`35`	`template <typename T>`
`35`	`36`	`int _partition2(T arr[], int l, int r){`
`36`	`37`