feat: revise code

fiteen · Dec 24, 2019 · 85d3231 · 85d3231
1 parent e6eee59
commit 85d3231
Show file tree

Hide file tree

Showing 4 changed files with 10 additions and 30 deletions.
diff --git a/HeapSort/README.md b/HeapSort/README.md
@@ -36,12 +36,8 @@ void heapify(int tree[], int n, int i) {
     // 右侧子节点下标
     int right = 2 * i + 2;
     int max = i;
-    if (left < n && tree[left] > tree[max]){
-        max = left;
-    }
-    if (right < n && tree[right] > tree[max]){
-        max = right;
-    }
+    if (left < n && tree[left] > tree[max]) max = left;
+    if (right < n && tree[right] > tree[max]) max = right;
     if (max != i) {
         swap(tree, max, i);
         heapify(tree, n, max);

diff --git a/HeapSort/heap_sort.c b/HeapSort/heap_sort.c
@@ -14,12 +14,8 @@ void heapify(int tree[], int n, int i) {
     // 右侧子节点下标
     int right = 2 * i + 2;
     int max = i;
-    if (left < n && tree[left] > tree[max]){
-        max = left;
-    }
-    if (right < n && tree[right] > tree[max]){
-        max = right;
-    }
+    if (left < n && tree[left] > tree[max]) max = left;
+    if (right < n && tree[right] > tree[max]) max = right;
     if (max != i) {
         swap(tree, max, i);
         heapify(tree, n, max);

diff --git a/QuickSort/README.md b/QuickSort/README.md
@@ -85,15 +85,9 @@ int select_pivot_median_of_three(int arr[], int low, int high) {
     // 计算数组中间的元素的下标
     int mid = low + ((high - low) >> 1);
     // 排序，使 arr[mid] <= arr[low] <= arr[high]
-    if (arr[mid] > arr[high]) {
-        swap(arr, mid, high);
-    }
-    if (arr[low] > arr[high]) {
-        swap(arr, low, high);
-    }
-    if (arr[mid] > arr[low]) {
-        swap(arr, low, mid);
-    }
+    if (arr[mid] > arr[high]) swap(arr, mid, high);
+    if (arr[low] > arr[high]) swap(arr, low, high);
+    if (arr[mid] > arr[low]) swap(arr, low, mid);
     // 使用 low 位置的元素作为基准
     return arr[low];
 }

diff --git a/QuickSort/quick_sort.c b/QuickSort/quick_sort.c
@@ -27,15 +27,9 @@ int select_pivot_median_of_three(int arr[], int low, int high) {
     // 计算数组中间的元素的下标
     int mid = low + ((high - low) >> 1);
     // 排序，使 arr[mid] <= arr[low] <= arr[high]
-    if (arr[mid] > arr[high]) {
-        swap(arr, mid, high);
-    }
-    if (arr[low] > arr[high]) {
-        swap(arr, low, high);
-    }
-    if (arr[mid] > arr[low]) {
-        swap(arr, low, mid);
-    }
+    if (arr[mid] > arr[high]) swap(arr, mid, high);
+    if (arr[low] > arr[high]) swap(arr, low, high);
+    if (arr[mid] > arr[low]) swap(arr, low, mid);
     // 使用 low 位置的元素作为基准
     return arr[low];
 }