formatting source-code for 2a44ee3

Author: github-actions

backtracking/graph_coloring.cpp

@@ -23,7 +23,7 @@ bool isSafe(int v, bool graph[V][V], int color[], int c) {
 
 /* A recursive utility function to solve m coloring problem */
 void graphColoring(bool graph[V][V], int m, int color[], int v) {
-    // base case: 
+    // base case:
     // If all vertices are assigned a color then return true
     if (v == V) {
         printSolution(color);
@@ -74,7 +74,7 @@ int main() {
 
     int color[V];
 
-    for (int i = 0; i < V; i++) { 
+    for (int i = 0; i < V; i++) {
         color[i] = 0;
     }
 

backtracking/knight_tour.cpp

@@ -57,7 +57,7 @@ int main() {
         cout << "solution doesnot exist \n";
     } else {
         for (i = 0; i < n; i++) {
-            for (j = 0; j < n; j++) { 
+            for (j = 0; j < n; j++) {
                 cout << sol[i][j] << "  ";
             }
             cout << "\n";

backtracking/n_queens.cpp

@@ -4,7 +4,7 @@
 void printSolution(int board[N][N]) {
     std::cout << "\n";
     for (int i = 0; i < N; i++) {
-        for (int j = 0; j < N; j++) { 
+        for (int j = 0; j < N; j++) {
             std::cout << "" << board[i][j];
         }
         std::cout << "\n";
@@ -54,7 +54,7 @@ void solveNQ(int board[N][N], int col) {
 
             // recur to place rest of the queens
             solveNQ(board, col + 1);
-            board[i][col] = 0; // BACKTRACK
+            board[i][col] = 0;  // BACKTRACK
         }
     }
 }

data_structures/doubly_linked_list.cpp

@@ -156,7 +156,9 @@ int main() {
             break;
 
         default:
-            if (choice == 0) { break; }
+            if (choice == 0) {
+                break;
+            }
             std::cout << "Wrong option; type an option : ";
             std::cin >> choice;
 

data_structures/linked_list.cpp

@@ -151,7 +151,9 @@ int main() {
             break;
 
         default:
-            if (choice == 0) { break; }
+            if (choice == 0) {
+                break;
+            }
             std::cout << "Wrong option; type an option : ";
             std::cin >> choice;
 

data_structures/list_array.cpp

@@ -156,7 +156,9 @@ int main() {
             break;
 
         default:
-            if (choice == 0) { break; }
+            if (choice == 0) {
+                break;
+            }
             std::cout << "Wrong option; type an option : ";
             std::cin >> choice;
 

data_structures/morrisinorder.cpp

@@ -60,15 +60,17 @@ void morrisInorder(Btree *root) {
             // Left of current node is stored in temp
             temp = curr->left;
             // Moving to extreme right of temp
-            while (temp->right && temp->right != curr) { temp = temp->right; }
+            while (temp->right && temp->right != curr) {
+                temp = temp->right;
+            }
             // If extreme right is null it is made to point to currrent node
             // (will be used for backtracking)
             if (temp->right == nullptr) {
                 temp->right = curr;
                 // current node is made to point its left subtree
                 curr = curr->left;
-            // If extreme right already points to currrent node it it set to
-            // null
+                // If extreme right already points to currrent node it it set to
+                // null
             } else if (temp->right == curr) {
                 std::cout << curr->data << " ";
                 temp->right = nullptr;
@@ -86,7 +88,7 @@ int main() {
     // Testing morrisInorder funtion
     Btree *root = nullptr;
     int i;
-    for (i = 1; i <= 7; i++) { 
+    for (i = 1; i <= 7; i++) {
         insert(&root, i);
     }
     std::cout << "Morris Inorder: ";

data_structures/queue_using_array.cpp

@@ -81,7 +81,7 @@ int main() {
             data = ob.dequeue();
             std::cout << "\ndequeue element is:\t" << data;
         } else if (op == 3) {
-             ob.display();
+            ob.display();
         } else if (op == 4) {
             exit(0);
         } else {

data_structures/tree.cpp

@@ -123,7 +123,9 @@ int main() {
             break;
 
         default:
-            if (ch == 0) { break; }
+            if (ch == 0) {
+                break;
+            }
             std::cout << "Wrong option; type an option : ";
             std::cin >> ch;
 

data_structures/trie_tree.cpp

@@ -4,7 +4,7 @@
 #include <iostream>
 #include <string>
 
-/** 
+/**
  * structure definition
  */
 typedef struct trie {
@@ -17,12 +17,14 @@ typedef struct trie {
  */
 trie* createNode() {
     trie* nn = new trie();
-    for (int i = 0; i < 26; i++) { nn->arr[i] = nullptr; }
+    for (int i = 0; i < 26; i++) {
+        nn->arr[i] = nullptr;
+    }
     nn->isEndofWord = false;
     return nn;
 }
 
-/** 
+/**
  * insert string into the trie
  */
 void insert(trie* root, std::string str) {
@@ -66,7 +68,9 @@ bool deleteString(trie* root, std::string str, int index) {
             return false;
         }
         root->isEndofWord = false;
-        for (int i = 0; i < 26; i++) { return false; }
+        for (int i = 0; i < 26; i++) {
+            return false;
+        }
         return true;
     }
     int j = str[index] - 'a';