formatting source-code for 153fb7b8a5

operations_on_datastructures/circular_queue_using_array.cpp

@@ -6,65 +6,49 @@ int front = 0;
 int rear = 0;
 int count = 0;
 
-void Enque(int x)
-{
-    if (count == 10)
-    {
+void Enque(int x) {
+    if (count == 10) {
         cout << "\nOverflow";
-    }
-    else
-    {
+    } else {
         queue[rear] = x;
         rear = (rear + 1) % 10;
         count++;
     }
 }
 
-void Deque()
-{
-    if (front == rear)
-    {
+void Deque() {
+    if (front == rear) {
         cout << "\nUnderflow";
     }
 
-    else
-    {
+    else {
         cout << "\n" << queue[front] << " deleted";
         front = (front + 1) % 10;
         count--;
     }
 }
 
-void show()
-{
-    for (int i = 0; i < count; i++)
-    {
+void show() {
+    for (int i = 0; i < count; i++) {
         cout << queue[(i + front) % 10] << "\t";
     }
 }
 
-int main()
-{
+int main() {
     int ch, x;
-    do
-    {
+    do {
         cout << "\n1. Enque";
         cout << "\n2. Deque";
         cout << "\n3. Print";
         cout << "\nEnter Your Choice : ";
         cin >> ch;
-        if (ch == 1)
-        {
+        if (ch == 1) {
             cout << "\nInsert : ";
             cin >> x;
             Enque(x);
-        }
-        else if (ch == 2)
-        {
+        } else if (ch == 2) {
             Deque();
-        }
-        else if (ch == 3)
-        {
+        } else if (ch == 3) {
             show();
         }
     } while (ch != 0);