feat: uniform space

fiteen · Dec 19, 2019 · 6cc62b3 · 6cc62b3
1 parent e6fe0bc
commit 6cc62b3
Show file tree

Hide file tree

Showing 8 changed files with 19 additions and 19 deletions.
diff --git a/BubbleSort/bubble_sort.c b/BubbleSort/bubble_sort.c
@@ -30,7 +30,7 @@ void bubble_sort_quicker(int arr[], int n) {
 }
 
 int main() {
-    int arr[] = { 7, 2, 5, 3, 8};
+    int arr[] = {7, 2, 5, 3, 8};
     int n = sizeof(arr) / sizeof(*arr);
     bubble_sort(arr, n);
     // bubble_sort_quicker(arr, n);

diff --git a/QuickSort/quick_sort.c b/QuickSort/quick_sort.c
@@ -61,7 +61,7 @@ void quick_sort(int arr[], int low, int high) {
 }
 
 int main() {
-    int arr[] = { 5, 1, 7, 2, 8, 3, 4, 9, 0, 6};
+    int arr[] = {5, 1, 7, 2, 8, 3, 4, 9, 0, 6};
     int n = sizeof(arr) / sizeof(*arr);
     quick_sort(arr, 0, n - 1);
     printf("Sort result:\n");

diff --git a/SelectionSort/README.md b/SelectionSort/README.md
@@ -19,11 +19,11 @@
 #### C语言
 
 ```c
-void selection_sort(int arr[], int len) {
+void selection_sort(int arr[], int n) {
     int i, j;
-    for (i = 0; i < len - 1; i++) {
+    for (i = 0; i < n - 1; i++) {
         int min = i;
-        for (j = i + 1; j < len; j++) {
+        for (j = i + 1; j < n; j++) {
             if (arr[j] < arr[min])
                 min = j;
         }

diff --git a/SelectionSort/selection_sort.c b/SelectionSort/selection_sort.c
@@ -6,11 +6,11 @@ void swap(int arr[], int i, int j) {
     arr[j] = temp;
 }
 
-void selection_sort(int arr[], int len) {
+void selection_sort(int arr[], int n) {
     int i, j;
-    for (i = 0; i < len - 1; i++) {
+    for (i = 0; i < n - 1; i++) {
         int min = i;
-        for (j = i + 1; j < len; j++) {
+        for (j = i + 1; j < n; j++) {
             if (arr[j] < arr[min])
                 min = j;
         }

diff --git a/ShellSort/README.md b/ShellSort/README.md
@@ -37,14 +37,14 @@ void shell_sort_split_half(int arr[], int n) {
 ```c
 void shell_insert(int arr[], int n, int dk) {
     int i, j, temp;
-    for (i = dk; i < n; i+= dk) {
+    for (i = dk; i < n; i += dk) {
         temp = arr[i];
         j = i - dk;
         while (j >= 0 && temp < arr[j]) {
-            arr[j+dk] = arr[j];
+            arr[j + dk] = arr[j];
             j -= dk;
         }
-        arr[j+dk] = temp;
+        arr[j + dk] = temp;
     }
 }
 

diff --git a/ShellSort/shell_sort.c b/ShellSort/shell_sort.c
@@ -14,14 +14,14 @@ void shell_sort_split_half(int arr[], int n) {
 
 void shell_insert(int arr[], int n, int dk) {
     int i, j, temp;
-    for (i = dk; i < n; i+= dk) {
+    for (i = dk; i < n; i += dk) {
         temp = arr[i];
         j = i - dk;
         while (j >= 0 && temp < arr[j]) {
-            arr[j+dk] = arr[j];
+            arr[j + dk] = arr[j];
             j -= dk;
         }
-        arr[j+dk] = temp;
+        arr[j + dk] = temp;
     }
 }
 

diff --git a/StraightInsertionSort/README.md b/StraightInsertionSort/README.md
@@ -19,8 +19,8 @@ void straight_insertion_sort(int arr[], int n) {
     int i, j, temp;
     for (i = 1; i < n; i++) {
         temp = arr[i];
-        for (j = i; j > 0 && arr[j-1] > temp; j--)
-            arr[j] = arr[j-1];
+        for (j = i; j > 0 && arr[j - 1] > temp; j--)
+            arr[j] = arr[j - 1];
         arr[j] = temp;
     }
 }

diff --git a/StraightInsertionSort/straight_insertion_sort.c b/StraightInsertionSort/straight_insertion_sort.c
@@ -4,14 +4,14 @@ void straight_insertion_sort(int arr[], int n) {
     int i, j, temp;
     for (i = 1; i < n; i++) {
         temp = arr[i];
-        for (j = i; j > 0 && arr[j-1] > temp; j--)
-            arr[j] = arr[j-1];
+        for (j = i; j > 0 && arr[j - 1] > temp; j--)
+            arr[j] = arr[j - 1];
         arr[j] = temp;
     }
 }
 
 int main() {
-    int arr[] = { 5, 1, 8, 5, 6, 3};
+    int arr[] = {5, 1, 8, 5, 6, 3};
     int n = sizeof(arr) / sizeof(*arr);
     straight_insertion_sort(arr, n);
     printf("Sort result:\n");