FilesExpand file tree

 main

/

09reorder_queue.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

49 lines (49 loc) · 959 Bytes

 main

/

09reorder_queue.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

49 lines (49 loc) · 959 Bytes

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

#include<bits/stdc++.h>

// redorder queue using stack

// 12345678

// 15263748

using namespace std;

int main(){

queue<int> q;

for(int i=1;i<=10;i++){

q.push(i);

}

stack<int> st;

int n = q.size();

//step 1 - first half in st

for(int i=1;i<=n/2;i++){

st.push(q.front());

q.pop();

}

//step 2 - st element in q

while(st.size()>0){

q.push(st.top());

st.pop();

}

//second half in stack

for(int i=1;i<=n/2;i++){

st.push(q.front());

q.pop();

}

//step 3 interleaf

while(st.size()>0){

q.push(st.top());

st.pop();

q.push(q.front());

q.pop();

}

//arrange in correct order

while(q.size()>0){

st.push(q.front());

q.pop();

}

while(st.size()>0){

q.push(st.top());

st.pop();

}

//display

while(q.size()>0){

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

q.pop();

}

}