Merge pull request #497 from shivaabhishek07/sa-arr-cpp

Arranged all the cpp programs in a single file

Author: gantavyamalviya

BFS_AND_DFS.cpp renamed to CPP/BFS_AND_DFS.cpp

@@ -1,95 +1,95 @@
-#include <bits/stdc++.h>
-using namespace std;
-
-int v;  //No. of Vertices
-
-void Add_edge(vector<int> adj[], int a, int b)
-{
-    adj[a].push_back(b);
-}
-
-/************************************* ALGORITHM FOR BREADTH FIRST SEARCH ******************************************************/
-
-// Take the empty queue and bool type array (visit) initialise with FALSE.
-// Push the starting node in the queue and set the value TRUE for this node in visited array.
-// Pop out the front node of the queue and print the node.
-// Push the adjacent node of pop node in queue which are not visited. Set the value TRUE in visited array of adding node.
-// Repeat step 3 and 4 until the queue becomes empty.
-
-void bfs(int n, vector<int>adj[])
-{
-    vector<bool> visit(v,false);
-    queue<int> q;
-    q.push(n);
-    visit[n]=true;
-    while(!q.empty())
-    {
-        n=q.front();
-        cout<<n<<" ";
-        q.pop();
-        for(int i=0;i<adj[n].size();i++)
-        {
-            if(!visit[adj[n][i]])
-            {
-                q.push(adj[n][i]);
-                visit[adj[n][i]]=true;
-            }
-        }
-    }
-}
-
-/************************************* ALGORITHM FOR DEPTH FIRST SEARCH ******************************************************/
-
-// Take the empty stack and bool type array (visit) initialise with FALSE.
-// Push the starting node in the stack and set the value TRUE for this node in visited array.
-// Pop the top node from the stack and print that node.
-// Push the adjacent node of pop node in the stack which is not visited. Set the value TRUE in visited array of adding node.
-// Repeat step 3 and 4 until the stack becomes empty.
-
-
-void dfs(int n, vector<int> adj[])
-{
-    vector<bool> visit(v,false);
-    stack<int> s;
-    s.push(n);
-    visit[n]=true;
-    while(!s.empty())
-    {
-        n=s.top();
-        cout<<n<<" ";
-        s.pop();
-        for(int i=0;i<adj[n].size();i++)
-        {
-            if(!visit[adj[n][i]])
-            {
-                s.push(adj[n][i]);
-                visit[adj[n][i]]=true;
-            }
-        }
-    }
-
-}
-
-int main()
-{
-     cout<<"Enter the no. of vertices : ";
-     cin>>v;
-     vector<int> adj[v];
-     vector<bool> visit(v,false);
-     Add_edge(adj,0,1);  
-     Add_edge(adj,0,2);  
-     Add_edge(adj,1,2);  
-     Add_edge(adj,2,0);    
-     Add_edge(adj,2,3);  
-     Add_edge(adj,3,3); 
-
-    int temp;
-    cout<<"Choose the vertex from you want to start traversing : ";
-    cin>>temp;
-    cout<<"\nBFS traversal is"<<" ";
-    bfs(temp,adj);
-    cout<<"\nDFS traversal is"<<" ";
-    dfs(temp,adj);
-
- return 0;
+#include <bits/stdc++.h>
+using namespace std;
+
+int v;  //No. of Vertices
+
+void Add_edge(vector<int> adj[], int a, int b)
+{
+    adj[a].push_back(b);
+}
+
+/************************************* ALGORITHM FOR BREADTH FIRST SEARCH ******************************************************/
+
+// Take the empty queue and bool type array (visit) initialise with FALSE.
+// Push the starting node in the queue and set the value TRUE for this node in visited array.
+// Pop out the front node of the queue and print the node.
+// Push the adjacent node of pop node in queue which are not visited. Set the value TRUE in visited array of adding node.
+// Repeat step 3 and 4 until the queue becomes empty.
+
+void bfs(int n, vector<int>adj[])
+{
+    vector<bool> visit(v,false);
+    queue<int> q;
+    q.push(n);
+    visit[n]=true;
+    while(!q.empty())
+    {
+        n=q.front();
+        cout<<n<<" ";
+        q.pop();
+        for(int i=0;i<adj[n].size();i++)
+        {
+            if(!visit[adj[n][i]])
+            {
+                q.push(adj[n][i]);
+                visit[adj[n][i]]=true;
+            }
+        }
+    }
+}
+
+/************************************* ALGORITHM FOR DEPTH FIRST SEARCH ******************************************************/
+
+// Take the empty stack and bool type array (visit) initialise with FALSE.
+// Push the starting node in the stack and set the value TRUE for this node in visited array.
+// Pop the top node from the stack and print that node.
+// Push the adjacent node of pop node in the stack which is not visited. Set the value TRUE in visited array of adding node.
+// Repeat step 3 and 4 until the stack becomes empty.
+
+
+void dfs(int n, vector<int> adj[])
+{
+    vector<bool> visit(v,false);
+    stack<int> s;
+    s.push(n);
+    visit[n]=true;
+    while(!s.empty())
+    {
+        n=s.top();
+        cout<<n<<" ";
+        s.pop();
+        for(int i=0;i<adj[n].size();i++)
+        {
+            if(!visit[adj[n][i]])
+            {
+                s.push(adj[n][i]);
+                visit[adj[n][i]]=true;
+            }
+        }
+    }
+
+}
+
+int main()
+{
+     cout<<"Enter the no. of vertices : ";
+     cin>>v;
+     vector<int> adj[v];
+     vector<bool> visit(v,false);
+     Add_edge(adj,0,1);  
+     Add_edge(adj,0,2);  
+     Add_edge(adj,1,2);  
+     Add_edge(adj,2,0);    
+     Add_edge(adj,2,3);  
+     Add_edge(adj,3,3); 
+
+    int temp;
+    cout<<"Choose the vertex from you want to start traversing : ";
+    cin>>temp;
+    cout<<"\nBFS traversal is"<<" ";
+    bfs(temp,adj);
+    cout<<"\nDFS traversal is"<<" ";
+    dfs(temp,adj);
+
+ return 0;
 }

Decimal_to_Binary.cpp renamed to CPP/Decimal_to_Binary.cpp

@@ -1,35 +1,35 @@
-#include <iostream>
-using namespace std;
-
-// Method 1
-bool Palindrome(string s,int start,int end){
-    if(start>=end){
-        return true;
-    }
-    return (s[start]==s[end])&&(Palindrome(s,start+1,end-1));
-}
-
-// Method 2
-void pal(string s){
-    int i=0,j=s.length()-1;
-    while(i<=j){
-        if(s[i]!=s[j]){
-            cout<<"String is not Palindrome";
-            return ;
-        }
-        i++,j--;
-    }
-    cout<<"String is palindrome";
-    return ;
-}
-
-int main(){
-    string s;
-    cin>>s;
-    cout<<s.length()<<endl;
-    cout<<Palindrome(s,0,s.length()-1);
-    cout<<endl;
-    pal(s);
-    
-    return 0;
+#include <iostream>
+using namespace std;
+
+// Method 1
+bool Palindrome(string s,int start,int end){
+    if(start>=end){
+        return true;
+    }
+    return (s[start]==s[end])&&(Palindrome(s,start+1,end-1));
+}
+
+// Method 2
+void pal(string s){
+    int i=0,j=s.length()-1;
+    while(i<=j){
+        if(s[i]!=s[j]){
+            cout<<"String is not Palindrome";
+            return ;
+        }
+        i++,j--;
+    }
+    cout<<"String is palindrome";
+    return ;
+}
+
+int main(){
+    string s;
+    cin>>s;
+    cout<<s.length()<<endl;
+    cout<<Palindrome(s,0,s.length()-1);
+    cout<<endl;
+    pal(s);
+    
+    return 0;
 }

Dynamic Programming/0-1_Knapsack.cpp renamed to CPP/Dynamic Programming/0-1_Knapsack.cpp

@@ -1,53 +1,53 @@
-class Solution {
-public:
-    int solvetab(vector<int> &nums)
-    {
-         vector<vector<int>> dp(nums.size()+3,vector<int>(nums.size()+3,0));
-        for(int curr= nums.size()-1;curr>=0;curr--)
-        {
-            for(int prev=curr-1;prev>=-1;prev--)
-            {
-                    
-                    int inc=0;
-                    //include
-                    if(prev==-1||nums[curr]>nums[prev])
-                    {
-                        inc= 1+dp[curr+1][curr+1];
-                    } 
-                    int excl=dp[curr+1][prev+1];
-                    dp[curr][prev+1]=max(inc,excl);
-
-            }
-        }
-        return dp[0][0];
-    }
-    int solve(vector<int> &nums,int i,int prev,vector<vector<int>> &dp)
-    {
-        //base condition
-        if(i>=nums.size())
-        {
-            return 0;
-        }
-        if(dp[i][prev+1]!=-1)
-        {
-            return dp[i][prev+1];
-        }
-        //exclude
-        int excl=solve(nums,i+1,prev,dp);
-        int inc=0;
-        //include
-        if(prev==-1||nums[i]>nums[prev])
-        {
-            inc= 1+solve(nums,i+1,i,dp);
-        }
-        
-        return dp[i][prev+1]=max(inc,excl);
-        
-    }
-    int lengthOfLIS(vector<int>& nums) {
-        // vector<vector<int>> dp(nums.size()+3,vector<int>(nums.size()+3,-1));
-        // return solve(nums,0,-1,dp);
-        return solvetab(nums);
-        
-    }
+class Solution {
+public:
+    int solvetab(vector<int> &nums)
+    {
+         vector<vector<int>> dp(nums.size()+3,vector<int>(nums.size()+3,0));
+        for(int curr= nums.size()-1;curr>=0;curr--)
+        {
+            for(int prev=curr-1;prev>=-1;prev--)
+            {
+                    
+                    int inc=0;
+                    //include
+                    if(prev==-1||nums[curr]>nums[prev])
+                    {
+                        inc= 1+dp[curr+1][curr+1];
+                    } 
+                    int excl=dp[curr+1][prev+1];
+                    dp[curr][prev+1]=max(inc,excl);
+
+            }
+        }
+        return dp[0][0];
+    }
+    int solve(vector<int> &nums,int i,int prev,vector<vector<int>> &dp)
+    {
+        //base condition
+        if(i>=nums.size())
+        {
+            return 0;
+        }
+        if(dp[i][prev+1]!=-1)
+        {
+            return dp[i][prev+1];
+        }
+        //exclude
+        int excl=solve(nums,i+1,prev,dp);
+        int inc=0;
+        //include
+        if(prev==-1||nums[i]>nums[prev])
+        {
+            inc= 1+solve(nums,i+1,i,dp);
+        }
+        
+        return dp[i][prev+1]=max(inc,excl);
+        
+    }
+    int lengthOfLIS(vector<int>& nums) {
+        // vector<vector<int>> dp(nums.size()+3,vector<int>(nums.size()+3,-1));
+        // return solve(nums,0,-1,dp);
+        return solvetab(nums);
+        
+    }
 };