[pull] master from TheAlgorithms:master

CMakeLists.txt

@@ -27,30 +27,30 @@ if(USE_OPENMP)
     endif()
 endif()
 
-add_subdirectory(math)
-add_subdirectory(others)
-add_subdirectory(search)
-add_subdirectory(ciphers)
-add_subdirectory(hashing)
-add_subdirectory(strings)
-add_subdirectory(sorting)
-add_subdirectory(geometry)
-add_subdirectory(graphics)
-add_subdirectory(probability)
 add_subdirectory(backtracking)
 add_subdirectory(bit_manipulation)
+add_subdirectory(ciphers)
+add_subdirectory(cpu_scheduling_algorithms)
+add_subdirectory(data_structures)
+add_subdirectory(divide_and_conquer)
 add_subdirectory(dynamic_programming)
+add_subdirectory(games)
+add_subdirectory(geometry)
+add_subdirectory(graph)
+add_subdirectory(graphics)
 add_subdirectory(greedy_algorithms)
-add_subdirectory(range_queries)
-add_subdirectory(operations_on_datastructures)
-add_subdirectory(data_structures)
+add_subdirectory(hashing)
 add_subdirectory(machine_learning)
+add_subdirectory(math)
 add_subdirectory(numerical_methods)
-add_subdirectory(graph)
-add_subdirectory(divide_and_conquer)
-add_subdirectory(games)
-add_subdirectory(cpu_scheduling_algorithms)
+add_subdirectory(operations_on_datastructures)
+add_subdirectory(others)
 add_subdirectory(physics)
+add_subdirectory(probability)
+add_subdirectory(range_queries)
+add_subdirectory(search)
+add_subdirectory(sorting)
+add_subdirectory(strings)
 
 cmake_policy(SET CMP0054 NEW)
 cmake_policy(SET CMP0057 NEW)

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/uint256_t.hpp

@@ -72,7 +72,7 @@ class uint256_t {
      */
     template <typename T, typename = typename std::enable_if<
                               std::is_integral<T>::value, T>::type>
-    explicit uint256_t(T low) : s(low), f(0) {}
+    explicit uint256_t(T low) : f(0), s(low) {}
 
     /**
      * @brief Parameterized constructor

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/stack_using_array.cpp

@@ -25,7 +25,7 @@ class Stack {
      *
      * @param size Maximum size of the stack
      */
-    Stack(int size) : stackSize(size), stackIndex(-1), stack(new T[size]) {}
+    Stack(int size) : stack(new T[size]), stackSize(size), stackIndex(-1) {}
 
     /**
      * @brief Checks if the stack is full

data_structures/tree_234.cpp

@@ -39,9 +39,9 @@ class Node {
      * @param item the first value we insert to the node
      */
     explicit Node(int64_t item)
-        : count(1),
-          items({{item, 0, 0}}),
-          children({{nullptr, nullptr, nullptr, nullptr}}) {}
+        : items({{item, 0, 0}}),
+          children({{nullptr, nullptr, nullptr, nullptr}}),
+          count(1) {}
 
     /**
      * @brief Get the item count that current saved in the node
@@ -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[]) {

data_structures/trie_tree.cpp

@@ -9,6 +9,7 @@
  */
 #include <array>
 #include <cassert>
+#include <cstdint>
 #include <iostream>
 #include <memory>
 #include <string>

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();

machine_learning/a_star_search.cpp

@@ -22,12 +22,14 @@
 #include <algorithm>   /// for `std::reverse` function
 #include <array>       /// for `std::array`, representing `EightPuzzle` board
 #include <cassert>     /// for `assert`
+#include <cstdint>     /// for `std::uint32_t`
 #include <functional>  /// for `std::function` STL
 #include <iostream>    /// for IO operations
 #include <map>         /// for `std::map` STL
 #include <memory>      /// for `std::shared_ptr`
 #include <set>         /// for `std::set` STL
 #include <vector>      /// for `std::vector` STL
+
 /**
  * @namespace machine_learning
  * @brief Machine learning algorithms

machine_learning/k_nearest_neighbors.cpp

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

machine_learning/kohonen_som_topology.cpp

@@ -579,7 +579,7 @@ double get_clock_diff(clock_t start_t, clock_t end_t) {
 }
 
 /** Main function */
-int main(int argc, char **argv) {
+int main() {
 #ifdef _OPENMP
     std::cout << "Using OpenMP based parallelization\n";
 #else

machine_learning/kohonen_som_trace.cpp

@@ -454,7 +454,7 @@ double get_clock_diff(clock_t start_t, clock_t end_t) {
 }
 
 /** Main function */
-int main(int argc, char **argv) {
+int main() {
 #ifdef _OPENMP
     std::cout << "Using OpenMP based parallelization\n";
 #else

math/eulers_totient_function.cpp

@@ -72,11 +72,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();
     return 0;
 }

math/modular_division.cpp

@@ -106,11 +106,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();  // execute the tests
     return 0;
 }

math/n_choose_r.cpp

@@ -73,11 +73,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();  // executing tests
     return 0;
 }

math/realtime_stats.cpp

@@ -155,7 +155,7 @@ void test_function(const float *test_data, const int number_of_samples) {
 }
 
 /** Main function */
-int main(int argc, char **argv) {
+int main() {
     const float test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};
     test_function(test_data1, sizeof(test_data1) / sizeof(test_data1[0]));
 

numerical_methods/babylonian_method.cpp

@@ -87,13 +87,11 @@ static void test() {
 
 /**
  * @brief Main function
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
  * calls automated test function to test the working of fast fourier transform.
  * @returns 0 on exit
  */
 
-int main(int argc, char const *argv[]) {
+int main() {
     test();  //  run self-test implementations
              //  with 2 defined test cases
     return 0;

numerical_methods/composite_simpson_rule.cpp

@@ -163,8 +163,8 @@ static void test(std::int32_t N, double h, double a, double b,
 
 /**
  * @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) {

numerical_methods/fast_fourier_transform.cpp

@@ -154,13 +154,11 @@ static void test() {
 
 /**
  * @brief Main function
- * @param argc commandline argument count (ignored)
- * @param argv commandline array of arguments (ignored)
  * calls automated test function to test the working of fast fourier transform.
  * @returns 0 on exit
  */
 
-int main(int argc, char const *argv[]) {
+int main() {
     test();  //  run self-test implementations
              //  with 2 defined test cases
     return 0;