clang-format and clang-tidy fixes for 3d017c44

math/power_of_two.cpp

@@ -3,18 +3,20 @@
  * @brief Implementation to check whether a number is a power of 2 or not.
  *
  * @details
- * This algorithm uses bit manipulation to check if a number is a power of 2 or not.
+ * This algorithm uses bit manipulation to check if a number is a power of 2 or
+ * not.
  *
  * ### Algorithm
- * Let the input number be n, then the bitwise and between n and n-1 will let us know 
- * whether the number is power of 2 or not
+ * Let the input number be n, then the bitwise and between n and n-1 will let us
+ * know whether the number is power of 2 or not
  *
  * For Example,
  * If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then
  * the result will be zero, which indicates that it is the power of 2
  * If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then
  * the result will not be zero , which indicates that it is not the power of 2
- * \note This implementation is better than naive recursive or iterative approach. 
+ * \note This implementation is better than naive recursive or iterative
+ * approach.
  *
  * @author [Neha Hasija](https://github.com/neha-hasija17)
  */
@@ -35,12 +37,11 @@ void power_of_two(int n){
     /// result stores the
     /// bitwise and of n and n-1
     int result = n & (n - 1);
-        if(result==0) 
-        
+    if (result == 0) {
         std::cout << "Yes, the number " << n << " is a power of 2";
-        else 
+    } else {
         std::cout << "No, the number " << n << " is not a power of 2";
-             
+    }
 }
 
 /**

sorting/pancake_sort.cpp

@@ -1,26 +1,25 @@
 /**
  * @file
- * @brief pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips.
+ * @brief pancake sort sorts a disordered stack of pancakes by flipping any
+ * number of pancakes using a spatula using minimum number of flips.
  *
  * @details
- * Unlike a traditional sorting algorithm, which attempts to sort with the fewest comparisons possible,
- * the goal is to sort the sequence in as few reversals as possible.
- * Overall time complexity of pancake sort is O(n^2)
- * For example: example 1:-
- * Disordered pancake sizes: {2,5,3,7,8}
- * Sorted: {2,3,5,7,8}
- * For example: example 2:-
- * Disordered pancake sizes: {22,51,37,73,81}
- * Sorted: {22,37,51,73,81}
+ * Unlike a traditional sorting algorithm, which attempts to sort with the
+ * fewest comparisons possible, the goal is to sort the sequence in as few
+ * reversals as possible. Overall time complexity of pancake sort is O(n^2) For
+ * example: example 1:- Disordered pancake sizes: {2,5,3,7,8} Sorted:
+ * {2,3,5,7,8} For example: example 2:- Disordered pancake sizes:
+ * {22,51,37,73,81} Sorted: {22,37,51,73,81}
  * @author [Divyansh Gupta](https://github.com/divyansh12323)
  * @see more on [Pancake sort](https://en.wikipedia.org/wiki/Pancake_sorting)
- * @see related problem at [Leetcode](https://leetcode.com/problems/pancake-sorting/)
+ * @see related problem at
+ * [Leetcode](https://leetcode.com/problems/pancake-sorting/)
  */
 
-#include <iostream>   // for io operations
-#include <vector>     // for std::vector
 #include <algorithm>  // for std::is_sorted
 #include <cassert>    // for std::assert
+#include <iostream>   // for io operations
+#include <vector>     // for std::vector
 
 /**
  * @namespace sorting
@@ -29,7 +28,8 @@
 namespace sorting {
 /**
  * @namespace pancake_sort
- * @brief Functions for [Pancake sort](https://en.wikipedia.org/wiki/Pancake_sorting) algorithm
+ * @brief Functions for [Pancake
+ * sort](https://en.wikipedia.org/wiki/Pancake_sorting) algorithm
  */
 namespace pancake_sort {
 /**
@@ -51,7 +51,8 @@ namespace pancake_sort {
     }
 }
 /**
-    * @brief This implementation is for a C-style array input that gets modified in place.
+ * @brief This implementation is for a C-style array input that gets modified in
+ * place.
  * @param [start,end] arr our vector of elements.
  * @param size size of given array
  * @returns 0 on exit
@@ -59,7 +60,7 @@ namespace pancake_sort {
 template <typename T>
 int pancakeSort(std::vector<T> &arr, int size) {
     for (int i = size; i > 1; --i) {
-            int max_index = 0, j; //intialize some variables.
+        int max_index = 0, j = 0;  // intialize some variables.
         T max_value = 0;
         for (j = 0; j < i; j++) {
             if (arr[j] >= max_value) {
@@ -98,7 +99,8 @@ static void test() {
     // example 2: vector of double
     const int size2 = 8;
     std::cout << "\nTest 2- as std::vector<double>...";
-    std::vector<double> arr2 = {23.56, 10.62, 200.78, 111.484, 3.9, 1.2, 61.77, 79.6};
+    std::vector<double> arr2 = {23.56, 10.62, 200.78, 111.484,
+                                3.9,   1.2,   61.77,  79.6};
     sorting::pancake_sort::pancakeSort(arr2, size2);
     assert(std::is_sorted(arr2.begin(), arr2.end()));
     std::cout << "Passed\n";