Merge branch 'master' into fix-namespace-issue

Author: realstealthninja

CONTRIBUTING.md

@@ -204,11 +204,9 @@ static void test() {
 
 /**
  * @brief Main function
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
  * @returns 0 on exit
  */
-int main(int argc, char *argv[]) {
+int main() {
     test();  // run self-test implementations
     // code here
     return 0;

ciphers/base64_encoding.cpp

@@ -11,7 +11,6 @@
  * digits.
  * @author [Ashish Daulatabad](https://github.com/AshishYUO)
  */
-#include <array>     /// for `std::array`
 #include <cassert>   /// for `assert` operations
 #include <cstdint>
 #include <iostream>  /// for IO operations

ciphers/hill_cipher.cpp

@@ -379,7 +379,6 @@ class HillCipher {
         int mat_determinant = det_encrypt < 0 ? det_encrypt % L : det_encrypt;
 
         matrix<double> tmp_inverse = get_inverse(encrypt_key);
-        double d2 = determinant_lu(decrypt_key);
 
         // find co-prime factor for inversion
         int det_inv = -1;

data_structures/rb_tree.cpp

@@ -33,7 +33,7 @@ class RBtree
 };
 void RBtree::insert()
 {
-	int z, i = 0;
+	int z;
 	cout << "\nEnter key of the node to be inserted: ";
 	cin >> z;
 	node *p, *q;

data_structures/sparse_table.cpp

@@ -155,11 +155,9 @@ static void test() {
 
 /**
  * @brief Main function
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
  * @returns 0 on exit
  */
-int main(int argc, char *argv[]) {
+int main() {
     test();  // run self-test implementations
     return 0;
 }

data_structures/tree_234.cpp

@@ -1291,8 +1291,8 @@ static void test2(int64_t n) {
 
 /**
  * @brief Main function
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
+ * @param argc commandline argument count
+ * @param argv commandline array of arguments
  * @returns 0 on exit
  */
 int main(int argc, char *argv[]) {

dynamic_programming/fibonacci_bottom_up.cpp

@@ -11,7 +11,7 @@ int fib(int n) {
     }
     return res[1];
 }
-int main(int argc, char const *argv[]) {
+int main() {
     int n;
     cout << "Enter n: ";
     cin >> n;

dynamic_programming/longest_increasing_subsequence.cpp

@@ -74,11 +74,9 @@ static void test() {
 
 /**
  * @brief Main function
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
  * @returns 0 on exit
  */
-int main(int argc, char const *argv[]) {
+int main() {
     uint32_t n = 0;
 
     std::cout << "Enter size of array: ";

dynamic_programming/longest_increasing_subsequence_nlogn.cpp

@@ -29,7 +29,7 @@ int LIS(const std::vector<int>& arr, int n) {
     }
     return active.size();  // size of the LIS.
 }
-int main(int argc, char const* argv[]) {
+int main() {
     int n;
     cout << "Enter size of array: ";
     cin >> n;

dynamic_programming/maximum_circular_subarray.cpp

@@ -67,7 +67,6 @@ static void test() {
     // Output: 22 
     // Explanation: Subarray 12, 8, -8, 9, -9, 10 gives the maximum sum, that is 22.
 
-    int n = 7; // size of the array
     std::vector<int> arr = {8, -8, 9, -9, 10, -11, 12}; 
     assert(dynamic_programming::maxCircularSum(arr) == 22); // this ensures that the algorithm works as expected
 
@@ -80,11 +79,9 @@ static void test() {
 
 /**
  * @brief Main function
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
  * @returns 0 on exit
  */
-int main(int argc, char *argv[]) {
+int main() {
      test();  // run self-test implementations
      return 0;
 }