style: format cpp code using clang-format

.clang-format

@@ -12,12 +12,12 @@ AlignTrailingComments: false
 AllowAllArgumentsOnNextLine: true
 AllowAllConstructorInitializersOnNextLine: true
 AllowAllParametersOfDeclarationOnNextLine: true
-AllowShortBlocksOnASingleLine: Empty
-AllowShortCaseLabelsOnASingleLine: false
+AllowShortBlocksOnASingleLine: Always
+AllowShortCaseLabelsOnASingleLine: true
 AllowShortFunctionsOnASingleLine: All
 AllowShortLambdasOnASingleLine: All
 AllowShortIfStatementsOnASingleLine: true
-AllowShortLoopsOnASingleLine: false
+AllowShortLoopsOnASingleLine: true
 AlwaysBreakAfterDefinitionReturnType: None
 AlwaysBreakAfterReturnType: None
 AlwaysBreakBeforeMultilineStrings: false
@@ -56,7 +56,7 @@ CompactNamespaces: false
 ConstructorInitializerAllOnOneLineOrOnePerLine: false
 ConstructorInitializerIndentWidth: 4
 ContinuationIndentWidth: 4
-Cpp11BracedListStyle: false
+Cpp11BracedListStyle: true
 DeriveLineEnding: true
 DerivePointerAlignment: false
 DisableFormat:   false

basic/sorting/BubbleSort/BubbleSort.cpp

@@ -3,17 +3,12 @@
 
 using namespace std;
 
-
-void bubbleSort(vector<int>& arr)
-{
+void bubbleSort(vector<int>& arr) {
     int n = arr.size();
-    for (int i = 0; i < n - 1; ++i)
-    {
+    for (int i = 0; i < n - 1; ++i) {
         bool change = false;
-        for (int j = 0; j < n - i - 1; ++j)
-        {
-            if (arr[j] > arr[j + 1])
-            {
+        for (int j = 0; j < n - i - 1; ++j) {
+            if (arr[j] > arr[j + 1]) {
                 swap(arr[j], arr[j + 1]);
                 change = true;
             }
@@ -22,8 +17,7 @@ void bubbleSort(vector<int>& arr)
     }
 }
 
-int main()
-{
+int main() {
     vector<int> arr = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
     bubbleSort(arr);
     for (int v : arr) cout << v << " ";

basic/sorting/BubbleSort/README.md

@@ -104,17 +104,12 @@ func main() {
 
 using namespace std;
 
-
-void bubbleSort(vector<int>& arr)
-{
+void bubbleSort(vector<int>& arr) {
     int n = arr.size();
-    for (int i = 0; i < n - 1; ++i)
-    {
+    for (int i = 0; i < n - 1; ++i) {
         bool change = false;
-        for (int j = 0; j < n - i - 1; ++j)
-        {
-            if (arr[j] > arr[j + 1])
-            {
+        for (int j = 0; j < n - i - 1; ++j) {
+            if (arr[j] > arr[j + 1]) {
                 swap(arr[j], arr[j + 1]);
                 change = true;
             }
@@ -123,8 +118,7 @@ void bubbleSort(vector<int>& arr)
     }
 }
 
-int main()
-{
+int main() {
     vector<int> arr = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
     bubbleSort(arr);
     for (int v : arr) cout << v << " ";

basic/sorting/InsertionSort/InsertionSort.cpp

@@ -3,26 +3,21 @@
 
 using namespace std;
 
-void printvec(const vector<int> &vec, const string &strbegin = "", const string &strend = "")
-{
+void printvec(const vector<int>& vec, const string& strbegin = "", const string& strend = "") {
     cout << strbegin << endl;
-    for (auto val : vec)
-    {
+    for (auto val : vec) {
         cout << val << "\t";
     }
 
     cout << endl;
     cout << strend << endl;
 }
 
-void insertsort(vector<int> &vec)
-{
-    for (int i = 1; i < vec.size(); i++)
-    {
+void insertsort(vector<int>& vec) {
+    for (int i = 1; i < vec.size(); i++) {
         int j = i - 1;
         int num = vec[i];
-        for (; j >= 0 && vec[j] > num; j--)
-        {
+        for (; j >= 0 && vec[j] > num; j--) {
             vec[j + 1] = vec[j];
         }
 
@@ -32,8 +27,7 @@ void insertsort(vector<int> &vec)
     return;
 }
 
-int main()
-{
+int main() {
     vector<int> vec = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
     printvec(vec);
     insertsort(vec);

basic/sorting/InsertionSort/README.md

@@ -95,26 +95,21 @@ func main() {
 
 using namespace std;
 
-void printvec(const vector<int> &vec, const string &strbegin = "", const string &strend = "")
-{
+void printvec(const vector<int>& vec, const string& strbegin = "", const string& strend = "") {
     cout << strbegin << endl;
-    for (auto val : vec)
-    {
+    for (auto val : vec) {
         cout << val << "\t";
     }
 
     cout << endl;
     cout << strend << endl;
 }
 
-void insertsort(vector<int> &vec)
-{
-    for (int i = 1; i < vec.size(); i++)
-    {
+void insertsort(vector<int>& vec) {
+    for (int i = 1; i < vec.size(); i++) {
         int j = i - 1;
         int num = vec[i];
-        for (; j >= 0 && vec[j] > num; j--)
-        {
+        for (; j >= 0 && vec[j] > num; j--) {
             vec[j + 1] = vec[j];
         }
 
@@ -124,8 +119,7 @@ void insertsort(vector<int> &vec)
     return;
 }
 
-int main()
-{
+int main() {
     vector<int> vec = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
     printvec(vec);
     insertsort(vec);

basic/sorting/MergeSort/Main.cpp

@@ -8,25 +8,24 @@ int n;
 int nums[N];
 int tmp[N];
 
-void merge_sort(int nums[], int left, int right)
-{
+void merge_sort(int nums[], int left, int right) {
     if (left >= right) return;
     int mid = (left + right) >> 1;
     merge_sort(nums, left, mid);
     merge_sort(nums, mid + 1, right);
     int i = left, j = mid + 1, k = 0;
-    while (i <= mid && j <= right)
-    {
-        if (nums[i] <= nums[j]) tmp[k++] = nums[i++];
-        else tmp[k++] = nums[j++];
+    while (i <= mid && j <= right) {
+        if (nums[i] <= nums[j])
+            tmp[k++] = nums[i++];
+        else
+            tmp[k++] = nums[j++];
     }
     while (i <= mid) tmp[k++] = nums[i++];
     while (j <= right) tmp[k++] = nums[j++];
     for (i = left, j = 0; i <= right; ++i, ++j) nums[i] = tmp[j];
 }
 
-int main()
-{
+int main() {
     int n;
     scanf("%d", &n);
     for (int i = 0; i < n; ++i) scanf("%d", &nums[i]);

basic/sorting/MergeSort/README.md

@@ -285,25 +285,24 @@ int n;
 int nums[N];
 int tmp[N];
 
-void merge_sort(int nums[], int left, int right)
-{
+void merge_sort(int nums[], int left, int right) {
     if (left >= right) return;
     int mid = (left + right) >> 1;
     merge_sort(nums, left, mid);
     merge_sort(nums, mid + 1, right);
     int i = left, j = mid + 1, k = 0;
-    while (i <= mid && j <= right)
-    {
-        if (nums[i] <= nums[j]) tmp[k++] = nums[i++];
-        else tmp[k++] = nums[j++];
+    while (i <= mid && j <= right) {
+        if (nums[i] <= nums[j])
+            tmp[k++] = nums[i++];
+        else
+            tmp[k++] = nums[j++];
     }
     while (i <= mid) tmp[k++] = nums[i++];
     while (j <= right) tmp[k++] = nums[j++];
     for (i = left, j = 0; i <= right; ++i, ++j) nums[i] = tmp[j];
 }
 
-int main()
-{
+int main() {
     int n;
     scanf("%d", &n);
     for (int i = 0; i < n; ++i) scanf("%d", &nums[i]);

basic/sorting/QuickSort/Main.cpp

@@ -7,23 +7,22 @@ const int N = 1e6 + 10;
 int n;
 int nums[N];
 
-void quick_sort(int nums[], int left, int right)
-{
+void quick_sort(int nums[], int left, int right) {
     if (left >= right) return;
     int i = left - 1, j = right + 1;
     int x = nums[left + right >> 1];
-    while (i < j)
-    {
-        while (nums[++i] < x);
-        while (nums[--j] > x);
+    while (i < j) {
+        while (nums[++i] < x)
+            ;
+        while (nums[--j] > x)
+            ;
         if (i < j) swap(nums[i], nums[j]);
     }
     quick_sort(nums, left, j);
     quick_sort(nums, j + 1, right);
 }
 
-int main()
-{
+int main() {
     int n;
     scanf("%d", &n);
     for (int i = 0; i < n; ++i) scanf("%d", &nums[i]);

basic/sorting/QuickSort/README.md

@@ -299,23 +299,22 @@ const int N = 1e6 + 10;
 int n;
 int nums[N];
 
-void quick_sort(int nums[], int left, int right)
-{
+void quick_sort(int nums[], int left, int right) {
     if (left >= right) return;
     int i = left - 1, j = right + 1;
     int x = nums[left + right >> 1];
-    while (i < j)
-    {
-        while (nums[++i] < x);
-        while (nums[--j] > x);
+    while (i < j) {
+        while (nums[++i] < x)
+            ;
+        while (nums[--j] > x)
+            ;
         if (i < j) swap(nums[i], nums[j]);
     }
     quick_sort(nums, left, j);
     quick_sort(nums, j + 1, right);
 }
 
-int main()
-{
+int main() {
     int n;
     scanf("%d", &n);
     for (int i = 0; i < n; ++i) scanf("%d", &nums[i]);

basic/sorting/SelectionSort/README.md

@@ -97,44 +97,35 @@ func main() {
 
 using namespace std;
 
-void printvec( const vector<int> &vec, const string &strbegin = "", const string &strend = "" )
-{
+void printvec(const vector<int>& vec, const string& strbegin = "", const string& strend = "") {
     cout << strbegin << endl;
-    for ( auto val : vec )
-    {
+    for (auto val : vec) {
         cout << val << "\t";
     }
 
     cout << endl;
     cout << strend << endl;
 }
 
-
-void selectsort( vector<int> & vec )
-{
-    for ( int i = 0; i < vec.size() - 1; i++ )
-    {
+void selectsort(vector<int>& vec) {
+    for (int i = 0; i < vec.size() - 1; i++) {
         int minidx = i;
-        for ( int j = i + 1; j < vec.size(); j++ )
-        {
-            if ( vec[minidx] > vec[j] )
-            {
+        for (int j = i + 1; j < vec.size(); j++) {
+            if (vec[minidx] > vec[j]) {
                 minidx = j;
             }
         }
 
-        swap( vec[i], vec[minidx] );
+        swap(vec[i], vec[minidx]);
     }
 }
 
-
-int main( void )
-{
-    vector<int> vec = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
-    printvec( vec );
-    selectsort( vec );
-    printvec( vec, "after insert sort" );
-    return(0);
+int main(void) {
+    vector<int> vec = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
+    printvec(vec);
+    selectsort(vec);
+    printvec(vec, "after insert sort");
+    return (0);
 }
 ```