Merge branch 'Lazeeez' of https://github.com/Lazeeez/C-Plus-Plus into Lazeeez

DIRECTORY.md

@@ -225,13 +225,11 @@
 ## Numerical Methods
   * [Bisection Method](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/bisection_method.cpp)
   * [Brent Method Extrema](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/brent_method_extrema.cpp)
-  * [Composite Simpson Rule](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/composite_simpson_rule.cpp)
   * [Durand Kerner Roots](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/durand_kerner_roots.cpp)
   * [False Position](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/false_position.cpp)
   * [Fast Fourier Transform](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/fast_fourier_transform.cpp)
   * [Gaussian Elimination](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/gaussian_elimination.cpp)
   * [Golden Search Extrema](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/golden_search_extrema.cpp)
-  * [Inverse Fast Fourier Transform](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/inverse_fast_fourier_transform.cpp)
   * [Lu Decompose](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/lu_decompose.cpp)
   * [Lu Decomposition](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/lu_decomposition.h)
   * [Midpoint Integral Method](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/midpoint_integral_method.cpp)

geometry/graham_scan_functions.hpp

@@ -63,18 +63,18 @@ struct Point {
 
 Point p0;
 
-    /******************************************************************************
+/******************************************************************************
-    * @brief A utility function to find next to top in a stack.
+ * @brief A utility function to find next to top in a stack.
-    * @param S Stack to be used for the process.
+ * @param S Stack to be used for the process.
-    * @returns @param Point Co-ordinates of the Point <int, int>
+ * @returns @param Point Co-ordinates of the Point <int, int>
-    *******************************************************************************/
+ *******************************************************************************/
-    Point nextToTop(std::stack<Point> *S) {
+Point nextToTop(std::stack<Point> *S) {
-        Point p = S->top();
+    Point p = S->top();
-        S->pop();
+    S->pop();
-        Point res = S->top();
+    Point res = S->top();
-        S->push(p);
+    S->push(p);
-        return res;
+    return res;
-    }
+}
 
 /******************************************************************************
  * @brief A utility function to return square of distance between p1 and p2.
@@ -165,25 +165,28 @@ std::vector<Point> convexHull(std::vector<Point> points, uint64_t size) {
         m++;  // Update size of modified array
     }
 
-        // If modified array of points has less than 3 points, convex hull is not possible
+    // If modified array of points has less than 3 points, convex hull is not
-        if (m < 3) return {};
+    // possible
+    if (m < 3)
+        return {};
 
-        // Create an empty stack and push first three points to it.
+    // Create an empty stack and push first three points to it.
-        std::stack <Point> S;
+    std::stack<Point> S;
-        S.push(points[0]);
+    S.push(points[0]);
-        S.push(points[1]);
+    S.push(points[1]);
-        S.push(points[2]);
+    S.push(points[2]);
 
-        // Process remaining n-3 points
+    // Process remaining n-3 points
-        for (int i = 3; i < m; i++) {
+    for (int i = 3; i < m; i++) {
-            // Keep removing top while the angle formed by
+        // Keep removing top while the angle formed by
-            // points next-to-top, top, and points[i] makes
+        // points next-to-top, top, and points[i] makes
-            // a non-left turn
+        // a non-left turn
-            while (S.size() > 1 && orientation(nextToTop(&S), S.top(), points[i]) != 2) {
+        while (S.size() > 1 &&
-                S.pop();
+               orientation(nextToTop(&S), S.top(), points[i]) != 2) {
-            }
+            S.pop();
-            S.push(points[i]);
         }
+        S.push(points[i]);
+    }
     // If modified array of points has less than 3 points, convex hull is not
     // possible
     if (m < 3) {
@@ -201,7 +204,8 @@ std::vector<Point> convexHull(std::vector<Point> points, uint64_t size) {
         // Keep removing top while the angle formed by
         // points next-to-top, top, and points[i] makes
         // a non-left turn
-        while (St.size() > 1 && orientation(nextToTop(&St), St.top(), points[i]) != 2) {
+        while (St.size() > 1 &&
+               orientation(nextToTop(&St), St.top(), points[i]) != 2) {
             St.pop();
         }
         St.push(points[i]);