Merge branch 'master' into properly_evaluate_GITHUB_ACTOR

Author: vil02

.github/workflows/awesome_workflow.yml

@@ -61,7 +61,7 @@ jobs:
           submodules: true
       - run: |
           cmake -B ./build -S .
-          cmake --build build
+          cmake --build build --parallel 4
       - name: Label on PR fail
         uses: actions/github-script@v6
         if: ${{ failure() && matrix.os == 'ubuntu-latest' && github.event_name == 'pull_request' }}

math/iterative_factorial.cpp

@@ -46,7 +46,7 @@ namespace math {
  */
 uint64_t iterativeFactorial(uint8_t n) {
     if (n > 20) {
-        throw new std::invalid_argument("Maximum n value is 20");
+        throw std::invalid_argument("Maximum n value is 20");
     }
 
     // 1 because it is the identity number of multiplication.
@@ -101,12 +101,14 @@ static void test() {
     std::cout << "Exception test \n"
                  "Input: 21 \n"
                  "Expected output: Exception thrown \n";
+
+    bool wasExceptionThrown = false;
     try {
         math::iterativeFactorial(21);
-    } catch (std::invalid_argument* e) {
-        std::cout << "Exception thrown successfully \nContent: " << e->what()
-                  << "\n";
+    } catch (const std::invalid_argument&) {
+        wasExceptionThrown = true;
     }
+    assert(wasExceptionThrown);
 
     std::cout << "All tests have passed successfully.\n";
 }

operations_on_datastructures/get_size_of_linked_list.cpp

@@ -16,6 +16,20 @@ int getSize(Node *root) {
     return 1 + getSize(root->next);
 }
 
+/*
+ * @brief This function dealocates memory related to the given list
+ * It recursively deletes all of the nodes of the input list.
+ * @param room the root/head of the input list
+ * @warning Plese note that the memory for each node has to be alocated using new.
+ */
+void deleteList(Node *const root) {
+    if (root != NULL)
+    {
+        deleteList(root->next);
+        delete root;
+    }
+}
+
 int main() {
     Node *myList = new Node(0, NULL);  // Initializes the LinkedList
     Node *temp = myList;
@@ -31,6 +45,8 @@ int main() {
     std::cout << getSize(myList) << std::endl
               << getSize(secondList) << std::endl
               << getSize(thirdList) << std::endl;
+    deleteList(secondList);
+    deleteList(myList);
 
     return 0;
 }

sorting/counting_sort.cpp

@@ -27,6 +27,9 @@ int *Counting_Sort(int Arr[], int N) {
     int *Sorted_Arr = new int[N];
 
     int *Count = new int[max - min + 1];
+    for (int i = 0; i < max - min + 1; ++i) {
+        Count[i] = 0;
+    }
 
     for (int i = 0; i < N; i++) Count[Arr[i] - min]++;
 
@@ -37,6 +40,7 @@ int *Counting_Sort(int Arr[], int N) {
         Count[Arr[i] - min]--;
     }
 
+    delete[] Count;
     return Sorted_Arr;
 }
 
@@ -51,6 +55,7 @@ int main() {
     Sorted_Arr = Counting_Sort(Arr, N);
     cout << "\n\t Sorted Array = ";
     Print(Sorted_Arr, N);
+    delete[] Sorted_Arr;
     cout << endl;
 
     return 0;

sorting/library_sort.cpp

@@ -69,6 +69,11 @@ void librarySort(int *index, int n) {
             index_pos_for_output++;
         }
     }
+    delete[] numbered;
+    delete[] gaps;
+    for (int i = 0; i < 2; ++i) {
+        delete[] library[i];
+    }
 }
 
 int main() {