refactor code

Author: codejsha

cpp-algorithm/src/dynamic_programming/fibonacci_number.cpp

@@ -2,9 +2,18 @@
 
 auto Fibonacci::FibonacciDynamicTopDown(const int number, std::vector<int>& memo) -> int
 {
-    if (number == 0) { return 0; }
-    if (number == 1) { return 1; }
-    if (memo[number] > 0) { return memo[number]; }
+    if (number == 0)
+    {
+        return 0;
+    }
+    if (number == 1)
+    {
+        return 1;
+    }
+    if (memo[number] > 0)
+    {
+        return memo[number];
+    }
 
     memo[number] = FibonacciDynamicTopDown(number - 1, memo) + FibonacciDynamicTopDown(number - 2, memo);
 
@@ -13,8 +22,14 @@ auto Fibonacci::FibonacciDynamicTopDown(const int number, std::vector<int>& memo
 
 auto Fibonacci::FibonacciDynamicBottomUp(const int number) -> int
 {
-    if (number == 0) { return 0; }
-    if (number == 1) { return 1; }
+    if (number == 0)
+    {
+        return 0;
+    }
+    if (number == 1)
+    {
+        return 1;
+    }
 
     std::vector<int> memo(number + 1, -1);
     memo[0] = 0;

cpp-algorithm/src/primitive_type/compute_parity.cpp

@@ -2,16 +2,6 @@
 
 #include <array>
 
-auto BuildTable() -> std::array<short, 1 << 16>
-{
-    std::array<short, 1 << 16> result{};
-    for (auto i = 0; i < (1 << 16); ++i)
-    {
-        result[i] = ComputingParity::Parity(i);
-    }
-    return result;
-}
-
 auto ComputingParity::CountBits(unsigned int x) -> short
 {
     short num_bits = 0;
@@ -45,6 +35,16 @@ auto ComputingParity::ParityDropLowestBits(unsigned long long x) -> short
     return result;
 }
 
+auto BuildTable() -> std::array<short, 1 << 16>
+{
+    std::array<short, 1 << 16> result{};
+    for (auto i = 0; i < (1 << 16); ++i)
+    {
+        result[i] = ComputingParity::Parity(i);
+    }
+    return result;
+}
+
 auto ComputingParity::ParityLookupTable(const unsigned long long x) -> short
 {
     constexpr auto mask_size = 16;

cpp-algorithm/src/search/search_sorted_matrix.cpp

@@ -10,7 +10,7 @@ bool SearchSortedMatrix::SearchSortedMatrix(const std::vector<std::vector<int>>&
     // matrix is empty, return false
     if (matrix.empty() || matrix[0].empty())
     {
-        return false; 
+        return false;
     }
 
     const auto row_size = static_cast<int>(matrix.size());