Merge branch 'master' into resolve_reorder

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;

data_structures/queue_using_array2.cpp

@@ -1,25 +1,24 @@
 #include <iostream>
-using namespace std;
 
 int queue[10];
 int front = 0;
 int rear = 0;
 
 void Enque(int x) {
     if (rear == 10) {
-        cout << "\nOverflow";
+        std::cout << "\nOverflow";
     } else {
         queue[rear++] = x;
     }
 }
 
 void Deque() {
     if (front == rear) {
-        cout << "\nUnderflow";
+        std::cout << "\nUnderflow";
     }
 
     else {
-        cout << "\n" << queue[front++] << " deleted";
+        std::cout << "\n" << queue[front++] << " deleted";
         for (int i = front; i < rear; i++) {
             queue[i - front] = queue[i];
         }
@@ -30,21 +29,21 @@ void Deque() {
 
 void show() {
     for (int i = front; i < rear; i++) {
-        cout << queue[i] << "\t";
+        std::cout << queue[i] << "\t";
     }
 }
 
 int main() {
     int ch, x;
     do {
-        cout << "\n1. Enque";
-        cout << "\n2. Deque";
-        cout << "\n3. Print";
-        cout << "\nEnter Your Choice : ";
-        cin >> ch;
+        std::cout << "\n1. Enque";
+        std::cout << "\n2. Deque";
+        std::cout << "\n3. Print";
+        std::cout << "\nEnter Your Choice : ";
+        std::cin >> ch;
         if (ch == 1) {
-            cout << "\nInsert : ";
-            cin >> x;
+            std::cout << "\nInsert : ";
+            std::cin >> x;
             Enque(x);
         } else if (ch == 2) {
             Deque();

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

@@ -79,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;
 }

dynamic_programming/minimum_edit_distance.cpp

@@ -166,11 +166,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;
 }

graph/hamiltons_cycle.cpp

@@ -136,10 +136,8 @@ static void test3() {
 /**
  * Main function
  *
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
  */
-int main(int argc, char **argv) {
+int main() {
     test1();
     test2();
     test3();