From dbfafdcd1a9e3feef3cd501ccecc66dc66d25a66 Mon Sep 17 00:00:00 2001
From: aadit_lab <adlab@git.aadit.cc>
Date: Tue, 13 Aug 2024 11:27:43 +0530
Subject: [PATCH] More interactive code

---
 DS/C/Lab/Week4/circq.c | 10 +++++++---
 1 file changed, 7 insertions(+), 3 deletions(-)

diff --git a/DS/C/Lab/Week4/circq.c b/DS/C/Lab/Week4/circq.c
index 9c9eb83..baacf85 100644
--- a/DS/C/Lab/Week4/circq.c
+++ b/DS/C/Lab/Week4/circq.c
@@ -1,6 +1,6 @@
 #include <stdio.h>
 
-#define MAX_SIZE 5
+#define MAX_SIZE 4
 
 int queue[MAX_SIZE];
 int front = 0;
@@ -8,7 +8,7 @@ int rear = 0;
 
 void enqueue(int data) {
     if ((rear + 1) % MAX_SIZE == front) {
-        printf("Queue is full\n");
+        printf("\n\nQueue is full\n\n\n");
         return;
     }
     queue[rear] = data;
@@ -41,11 +41,12 @@ void printQueue() {
 int main() {
     int choice, data;
     while (1) {
+        printf("Choose the Circular Queue option you would like to perform:\n");
         printf("1. Enqueue\n2. Dequeue\n3. Print Queue\n4. Exit\n");
         scanf("%d", &choice);
         switch (choice) {
             case 1:
-                printf("Enter data: ");
+                printf("Enter the value for the latest element: ");
                 scanf("%d", &data);
                 enqueue(data);
                 break;
@@ -58,6 +59,9 @@ int main() {
                 break;
             case 4:
                 return 0;
+            default:
+                printf("Invalid choice.");
+                return -1;
         }
     }
 }