FilesExpand file tree

 main

/

04array_implmnt_queue.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

53 lines (53 loc) · 1.29 KB

 main

/

04array_implmnt_queue.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

53 lines (53 loc) · 1.29 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include<iostream>

using namespace std;

// problems unused or extra use of memory

// when frnt pointer reaches certain index

// after pop() we cannot access prev elements in correct order

class Queue{

int arr[100],frnt,bck;

public:

Queue(){frnt = bck = 0;}

void push(int val){

if(bck>99){

cerr<<"Overflow";

return;

}

arr[bck] = val; bck++;

}

void pop(){ if(frnt<bck) frnt++; }

int front(){ if(size()!=0) return arr[frnt]; else return -1; }

int back(){ if(size()!=0) return arr[bck-1]; else return -1; }

int size(){ return bck-frnt; }

bool empty(){ if(size()==0) return true; else return false;}

void display(){

for(int i=frnt;i<bck;i++){

cout<<arr[i]<<" ";

}

cout<<endl;

}

};

int main(){

Queue q;

q.push(10);

q.push(20);

q.push(30);

q.push(40);

q.push(50);

q.push(60);

q.push(70);

q.display();

q.pop();

q.pop();

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

cout<<q.size()<<endl;

}

/*

More efficient method can be using LinkedList using

head as front and tail as back and using everything

just like a linkedlist

Advantage above array implementation

unlimited size

Efficient use of space

Constant time complexity

Use delete() whenever deleting a node

*/