DSA/DSA Assignment 10-deque(array).cpp at master · mohanashwin999/DSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
#include<iostream>
using namespace std;
#define size 20
class dequ
{
    int a[40],front,rear;
public:
    dequ()
    {
        front=-1;
        rear=-1;
    }

    int is_dq_empty()
    {
        if(front==-1 && rear==-1)
            return 1;
        else
            return 0;
    }

    int is_dq_full()
    {
        if(rear==size-1)
            return 1;
        else
            return 0;
    }
    void insert_start(int x)
    {
        if(is_dq_full())
            cout<<"\n Queue is full";
        else if(front==0 && rear<size-1)
        {
            for(int i=rear;i>=front;i--)
            {
                a[i+1]=a[i];
            }
            a[front]=x;
            rear++;
        }
        else if(is_dq_empty())
        {
            front++;
            rear++;
            a[rear]=x;
        }
}

   void insert_end(int y)
    {
        if(is_dq_full())
            cout<<"\n Queue is full";
        else if(front==0 && rear<size-1)
        {
            rear++;
            a[rear]=y;
        }
        else if(is_dq_empty())
        {
            front++;
            rear++;
            a[rear]=y;
        }
    }

    void delete_front()
    {
        if(is_dq_empty())
            cout<<"\n Queue is empty..cannot delete";
        else
            front++;
    }

    void delete_end()
    {
       if(is_dq_empty())
            cout<<"\n Queue is empty..cannot delete";
        else
            rear--;
    }

    void display()
    {
        if(is_dq_empty())
            cout<<"\n Queue is empty..can't display";

        for(int i=front;i<=rear;i++)
        {
            cout<<a[i]<<" ";
        }
    }

};
int main()
{
    dequ d;
    int a,b,ch,c;
    int p,e;
    do
    {
        cout<<"\n Enter 1 to insert at start \n Enter 2 to insert at last";
        cout<<"\n Enter 3 to display \n Enter 4 to delete from front \n Enter 5 to delete from end";
        cin>>ch;
        switch(ch)
        {
        case 1:
            cout<<"\n Enter element";
            cin>>a;
            d.insert_start(a);
            break;
        case 2:
            cout<<"\n Enter element";
            cin>>b;
            d.insert_end(b);
            break;
        case 3:
                d.display();
                break;
        case 4:
             cout<<"\n Deleting an element from front";
             d.delete_front();
             break;
        case 5:
            cout<<"\n Deleting an element from end";
            d.delete_end();
            break;
        }
          cout<<"\n do u want to continue";
          cin>>ch;
    }while(ch==1);
    return 0;
}