From dac27e4df275885087ec05265f5e585721025593 Mon Sep 17 00:00:00 2001 From: realstealthninja Date: Fri, 15 Aug 2025 04:07:04 +0000 Subject: [PATCH] Documentation for 13306be79f852e103fca650f4baeff05821498b6 --- df/da7/queue__using__array2_8cpp_source.html | 112 +++++++++---------- 1 file changed, 56 insertions(+), 56 deletions(-) diff --git a/df/da7/queue__using__array2_8cpp_source.html b/df/da7/queue__using__array2_8cpp_source.html index 8f9c08260..152490ccb 100644 --- a/df/da7/queue__using__array2_8cpp_source.html +++ b/df/da7/queue__using__array2_8cpp_source.html @@ -117,62 +117,62 @@ $(function(){initNavTree('df/da7/queue__using__array2_8cpp_source.html','../../'
1#include <iostream>
-
2using namespace std;
-
3
-
4int queue[10];
-
5int front = 0;
-
6int rear = 0;
-
7
-
8void Enque(int x) {
-
9 if (rear == 10) {
-
10 cout << "\nOverflow";
-
11 } else {
-
12 queue[rear++] = x;
-
13 }
-
14}
-
15
-
16void Deque() {
-
17 if (front == rear) {
-
18 cout << "\nUnderflow";
-
19 }
-
20
-
21 else {
-
22 cout << "\n" << queue[front++] << " deleted";
-
23 for (int i = front; i < rear; i++) {
-
24 queue[i - front] = queue[i];
-
25 }
-
26 rear = rear - front;
-
27 front = 0;
-
28 }
-
29}
-
30
-
31void show() {
-
32 for (int i = front; i < rear; i++) {
-
33 cout << queue[i] << "\t";
-
34 }
-
35}
-
36
-
37int main() {
-
38 int ch, x;
-
39 do {
-
40 cout << "\n1. Enque";
-
41 cout << "\n2. Deque";
-
42 cout << "\n3. Print";
-
43 cout << "\nEnter Your Choice : ";
-
44 cin >> ch;
-
45 if (ch == 1) {
-
46 cout << "\nInsert : ";
-
47 cin >> x;
-
48 Enque(x);
-
49 } else if (ch == 2) {
-
50 Deque();
-
51 } else if (ch == 3) {
-
52 show();
-
53 }
-
54 } while (ch != 0);
-
55
-
56 return 0;
-
57}
+
2
+
3int queue[10];
+
4int front = 0;
+
5int rear = 0;
+
6
+
7void Enque(int x) {
+
8 if (rear == 10) {
+
9 std::cout << "\nOverflow";
+
10 } else {
+
11 queue[rear++] = x;
+
12 }
+
13}
+
14
+
15void Deque() {
+
16 if (front == rear) {
+
17 std::cout << "\nUnderflow";
+
18 }
+
19
+
20 else {
+
21 std::cout << "\n" << queue[front++] << " deleted";
+
22 for (int i = front; i < rear; i++) {
+
23 queue[i - front] = queue[i];
+
24 }
+
25 rear = rear - front;
+
26 front = 0;
+
27 }
+
28}
+
29
+
30void show() {
+
31 for (int i = front; i < rear; i++) {
+
32 std::cout << queue[i] << "\t";
+
33 }
+
34}
+
35
+
36int main() {
+
37 int ch, x;
+
38 do {
+
39 std::cout << "\n1. Enque";
+
40 std::cout << "\n2. Deque";
+
41 std::cout << "\n3. Print";
+
42 std::cout << "\nEnter Your Choice : ";
+
43 std::cin >> ch;
+
44 if (ch == 1) {
+
45 std::cout << "\nInsert : ";
+
46 std::cin >> x;
+
47 Enque(x);
+
48 } else if (ch == 2) {
+
49 Deque();
+
50 } else if (ch == 3) {
+
51 show();
+
52 }
+
53 } while (ch != 0);
+
54
+
55 return 0;
+
56}
+
queue
Definition queue.hpp:9
main
int main()
Main function.
Definition generate_parentheses.cpp:110