Added Stack Operations based on Arrays using the programming language C++

Competitive Coding/Data Structures/Stack/Stack_C++/README.md

@@ -0,0 +1,12 @@
+# C++
+
+## Stack Operations 
+
+### This Folder contains the following files:
+
+1. All Basic Stack Operations based on **Arrays** [File Link](https://github.com/Zanark/Algorithms/blob/78ac861cc519e8e2b400094bddac6fa3e59b859e/Competitive%20Coding/Data%20Structures/Stack/Stack_C%2B%2B/Stack_operations_using_Arrays.cpp#L2)
+
+   * *Inserting* an element onto the stack { **PUSH** } [Code](https://github.com/Zanark/Algorithms/blob/78ac861cc519e8e2b400094bddac6fa3e59b859e/Competitive%20Coding/Data%20Structures/Stack/Stack_C%2B%2B/Stack_operations_using_Arrays.cpp#L24-L33)
+   * *Deleting*  an element from the stack  { **POP**   } [Code](https://github.com/Zanark/Algorithms/blob/78ac861cc519e8e2b400094bddac6fa3e59b859e/Competitive%20Coding/Data%20Structures/Stack/Stack_C%2B%2B/Stack_operations_using_Arrays.cpp#L36-L44)
+   * *Displaying* the Stack [Code](https://github.com/Zanark/Algorithms/blob/78ac861cc519e8e2b400094bddac6fa3e59b859e/Competitive%20Coding/Data%20Structures/Stack/Stack_C%2B%2B/Stack_operations_using_Arrays.cpp#L47-L60)
+

Competitive Coding/Data Structures/Stack/Stack_C++/Stack_operations_using_Arrays.cpp

@@ -0,0 +1,95 @@
+
+// All Operations on Stacks based on ARRAYS
+//--------------------------------------------------------------------------------------
+
+#include<iostream>
+#include<conio.h>
+#include<stdlib.h>
+
+using namespace std;
+
+class stack
+{
+             int stk[101];
+             int top;
+
+      public:
+
+             stack()                                         // Initialising an Empty Stack
+              {
+                top=-1;
+              }
+
+
+             void push(int x)                               // To Insert Elements onto the Stack
+              {
+                 if(top >  100)                             // To Check if the Stack is already FULL 
+                       {
+                           cout <<"\n\n !!!! Stack over flow !!!!";
+                           return;
+                       }
+                 stk[++top]=x;
+                 cout <<"\n The inserted element is : \t" <<x;     // Inserting a NEW element and making it the NEW Top
+               }
+
+
+             void pop()                                    // To Delete an element from the Stack
+               {
+                  if(top <0)                               // To check if the Stack is already EMPTY
+                   {
+                         cout <<"\n\n !!!! Stack under flow !!!!";
+                         return;
+                    }
+                    cout <<"deleted" <<stk[top--];         // Deleting an element and making the PREVIOUS element the NEW TOP
+                }
+
+
+             void display()                               // To Display the Stack
+               {
+                   if(top<0)
+                    {
+                            cout <<"\n\n Stack is empty :(";
+                            return;
+                    }
+                    for(int i=top;i>=0;i--)
+                    {
+                        if (i == top)
+                          cout<<"\n Top -->  ";
+                        cout <<stk[i] <<"    ";                        
+                    }
+                }
+};
+
+main()
+{
+     int ch;
+     int ele;
+     stack st;
+     while(1)
+        {
+            cout << "\n What do you want to do?"
+                 << "\n\n 1. Push an element onto the Stack"
+                 << "\n\n 2. Pop  an element from the Stack"
+                 << "\n\n 3. Display the Stack"
+                 << "\n\n 4. EXIT the program"
+                 << "\n\n\n\n Please Enter your choice\n";
+            cin >> ch;
+            switch (ch)
+            {
+            case 1:
+                cout << "\n Enter the element \t:\t";
+                cin >> ele;
+                st.push(ele);
+                break;
+            case 2:
+                st.pop();
+                break;
+            case 3:
+                st.display();
+                break;
+            case 4:
+                exit(0);
+               }
+         }
+return (0);
+}