OOP/deque.cpp at master · komalsupekar/OOP · 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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
 /*

     * C++ Program to Implement Deque in Stl

     */

    #include <iostream>

    #include <deque>

    #include <string>

    #include <cstdlib>

    using namespace std;

    int main()

    {

        deque<int> dq;

        deque<int>::iterator it;

        int choice, item;

        while (1)

        {

            cout<<"\n---------------------"<<endl;

            cout<<"Deque Implementation in Stl"<<endl;

            cout<<"\n---------------------"<<endl;

            cout<<"1.Insert Element at the End"<<endl;

            cout<<"2.Insert Element at the Front"<<endl;

    	cout<<"3.Delete Element at the End"<<endl;

            cout<<"4.Delete Element at the Front"<<endl;

            cout<<"5.Front Element at Deque"<<endl;

            cout<<"6.Last Element at Deque"<<endl;

            cout<<"7.Size of the Deque"<<endl;

            cout<<"8.Display Deque"<<endl;

            cout<<"9.Exit"<<endl;

            cout<<"Enter your Choice: ";

            cin>>choice;

            switch(choice)

            {

            case 1:

                cout<<"Enter value to be inserted at the end: ";

                cin>>item;

                dq.push_back(item);

                break;

            case 2:

                cout<<"Enter value to be inserted at the front: ";

                cin>>item;

                dq.push_front(item);

                break;

            case 3:

                item = dq.back();

                dq.pop_back();

    	    cout<<"Element "<<item<<" deleted"<<endl;

                break;

            case 4:

                item = dq.front();

                dq.pop_front();

                cout<<"Element "<<item<<" deleted"<<endl;

                break;

            case 5:

                cout<<"Front Element of the Deque: ";

                cout<<dq.front()<<endl;

                break;

            case 6:

                cout<<"Back Element of the Deque: ";

                cout<<dq.back()<<endl;

                break;

            case 7:

                cout<<"Size of the Deque: "<<dq.size()<<endl;

                break;

            case 8:

                cout<<"Elements of Deque:  ";

                for (it = dq.begin(); it != dq.end(); it++)

                    cout<<*it<<"  ";

                cout<<endl;

                break;

            case 9:

                exit(1);

    	    break;

            default:

                cout<<"Wrong Choice"<<endl;

            }

        }

        return 0;

    }