formatting filenames d7af6fdc8c

operations_on_datastructures/circular_queue_using_array.cpp

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