algo_078
Problem Statement
Problem Statement
Write an algorithm to delete an element from a deque (from the front).
Algorithm
procedure DeleteDequeFront(DEQ, MAX, FRONT, REAR)
begin
if FRONT = -1 then
print("Underflow")
return(NULL)
endif
ITEM ← DEQ[FRONT]
if FRONT = REAR then
FRONT ← -1
REAR ← -1
else if FRONT = MAX then
FRONT ← 1
else
FRONT ← FRONT + 1
endif
return(ITEM)
end procedure1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20