Added Circular queue, dequeue and queue using stack code

Author: AriesShilz

Balanced Paranthesis.txt

@@ -1,70 +1,70 @@
-#include <iostream>
-#include<stack>
-using namespace std;
-
-int length(char *exp){
-int length=0;    
-for(int i=0;exp[i]!='\0';i++)
-length++;
-return length;	
-}
-
-
-
-bool checkBalanced(char *exp){
-    stack<int> st;
-    int l =length(exp);
-    for(int i = 0 ; i < l ; i++){
-        
-        if(exp[i]=='('||exp[i]=='{'||exp[i]=='['){
-         st.push(exp[i]);
-         continue;   
-        }
-        
-        else if(exp[i]==')'){
-            if(st.empty() == false){
-               if(st.top()=='(')
-                  st.pop();
-            }
-                else
-                    return false;
-                        }
-        
-        
-            else if(exp[i]=='}'){
-                if(st.empty() == false){
-            if(st.top()=='{')
-                st.pop();
-                }
-                else
-                    return false;
-                        }
-            else if(exp[i]==']'){
-                if(st.empty() == false){
-            if(st.top()=='[')
-                st.pop();
-                }
-                else
-                    return false;
-        }
-            
-        }
-       
-    
-    if(st.empty()==true){
-        return true;
-    }
-    else
-        return false;
-}
-
-int main() {
-    char input[100000];
-    cin.getline(input, 100000);
-    if(checkBalanced(input)) {
-        cout << "true" << endl;
-    }
-    else {
-        cout << "false" << endl;
-    }
-}
+#include <iostream>
+#include<stack>
+using namespace std;
+
+int length(char *exp){
+int length=0;    
+for(int i=0;exp[i]!='\0';i++)
+length++;
+return length;	
+}
+
+
+
+bool checkBalanced(char *exp){
+    stack<int> st;
+    int l =length(exp);
+    for(int i = 0 ; i < l ; i++){
+        
+        if(exp[i]=='('||exp[i]=='{'||exp[i]=='['){
+         st.push(exp[i]);
+         continue;   
+        }
+        
+        else if(exp[i]==')'){
+            if(st.empty() == false){
+               if(st.top()=='(')
+                  st.pop();
+            }
+                else
+                    return false;
+                        }
+        
+        
+            else if(exp[i]=='}'){
+                if(st.empty() == false){
+            if(st.top()=='{')
+                st.pop();
+                }
+                else
+                    return false;
+                        }
+            else if(exp[i]==']'){
+                if(st.empty() == false){
+            if(st.top()=='[')
+                st.pop();
+                }
+                else
+                    return false;
+        }
+            
+        }
+       
+    
+    if(st.empty()==true){
+        return true;
+    }
+    else
+        return false;
+}
+
+int main() {
+    char input[100000];
+    cin.getline(input, 100000);
+    if(checkBalanced(input)) {
+        cout << "true" << endl;
+    }
+    else {
+        cout << "false" << endl;
+    }
+}

C++/SieveOfEratosthenes.cpp

@@ -1,36 +1,36 @@
-#include <iostream>
-#include <stdbool.h>
-#include <cstring>
-#include <conio.h>
-
-using namespace std;
-
-void SieveOfEratosthenes(int n)
-{
-	long int i,p;
-	bool arr[n+1];
-	memset(arr,true,sizeof(arr));
-	for(i=2;i*i<=n;i++)
-	{
-		if(arr[i]==true)
-		{
-			for(p=i*i;p<=n;p=p+i)
-			{
-				arr[p]=false;
-			}
-		}
-	}
-	for(i=2;i<=n;i++)
-	{
-		if(arr[i]==true)
-		cout<<i<<endl;
-	}
-}
-int main()
-{
-	long int x;
-	cin>>x;
-	SieveOfEratosthenes(x);
-	getch();
-	return (0);
-}
+#include <iostream>
+#include <stdbool.h>
+#include <cstring>
+#include <conio.h>
+
+using namespace std;
+
+void SieveOfEratosthenes(int n)
+{
+	long int i,p;
+	bool arr[n+1];
+	memset(arr,true,sizeof(arr));
+	for(i=2;i*i<=n;i++)
+	{
+		if(arr[i]==true)
+		{
+			for(p=i*i;p<=n;p=p+i)
+			{
+				arr[p]=false;
+			}
+		}
+	}
+	for(i=2;i<=n;i++)
+	{
+		if(arr[i]==true)
+		cout<<i<<endl;
+	}
+}
+int main()
+{
+	long int x;
+	cin>>x;
+	SieveOfEratosthenes(x);
+	getch();
+	return (0);
+}

C++/insertionsort.cpp

@@ -1,32 +1,32 @@
-#include<iostream>
-using namespace std;
-int main()
-{
-    int n;
-    cout<<"Enter the length of the array : ";
-    cin>>n;
-    int a[n];
-    cout<<"Insert the elements to perform sorting... "<<endl;
-    for (int u = 0; u <n ; u++)
-    {
-        cout<<"Enter the "<<u+1<<" element : ";
-        cin>>a[u];
-    }
-
-
-    int j,key,i;
-    for (i = 1; i < n; i++)
-    {
-        key = a[i];
-        j = i - 1;
-        while (j>=0&& a[j]>key)
-        {
-            a[j + 1] = a[j];
-            j=j-1;
-        }
-        a[j+1]=key;
-    }
-    for (i = 0; i < n; i++)
-        cout<<a[i]<< " ";
-    return 0;
-}
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n;
+    cout<<"Enter the length of the array : ";
+    cin>>n;
+    int a[n];
+    cout<<"Insert the elements to perform sorting... "<<endl;
+    for (int u = 0; u <n ; u++)
+    {
+        cout<<"Enter the "<<u+1<<" element : ";
+        cin>>a[u];
+    }
+
+
+    int j,key,i;
+    for (i = 1; i < n; i++)
+    {
+        key = a[i];
+        j = i - 1;
+        while (j>=0&& a[j]>key)
+        {
+            a[j + 1] = a[j];
+            j=j-1;
+        }
+        a[j+1]=key;
+    }
+    for (i = 0; i < n; i++)
+        cout<<a[i]<< " ";
+    return 0;
+}

CaesarCipher/Python/CaesarCipher.py

@@ -1,7 +1,7 @@
-letters = input()
-rot = int(input())
-for i in range(len(letters)):
-    print(letters[(i + rot) % len(letters)], end='')
-print('\n', letters, sep='')
-for i in range(len(letters)):
+letters = input()
+rot = int(input())
+for i in range(len(letters)):
+    print(letters[(i + rot) % len(letters)], end='')
+print('\n', letters, sep='')
+for i in range(len(letters)):
     print(letters[(i - rot) % len(letters)], end='')

Calculator/Calculator.depend

@@ -1,4 +1,4 @@
-# depslib dependency file v1.0
-1570949579 source:c:\users\yakov\desktop\codeblocks\calculator\main.cpp
-	<bits/stdc++.h>
-
+# depslib dependency file v1.0
+1570949579 source:c:\users\yakov\desktop\codeblocks\calculator\main.cpp
+	<bits/stdc++.h>
+