FilesExpand file tree

main

/

queue_array.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

85 lines (80 loc) · 1.38 KB

main

/

queue_array.c

Copy path

Top

File metadata and controls

• Code
• Blame

85 lines (80 loc) · 1.38 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

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

#include<stdio.h>

#include<stdlib.h>

int queue[20],a,n,choice;

int rear=-1,front=-1;

void enqueue(int a);

void dequeue();

void display();

void peek();

void menu();

void main()

{

printf("Enter the size of the queue:");

scanf("%d",&n);

menu();

}

void menu()

{

printf("\n Menu\n1.Enqueue\n2.Dequeue\n3.Peek\n4.Display\n5.Exit\n");

printf("\nEnter your choice:");

scanf("%d",&choice);

switch(choice)

{

case 1:enqueue(a);

break;

case 2:dequeue();

break;

case 3:peek();

break;

case 4:display();

break;

case 5:exit(1);

default:printf("Enter a valid choice");

menu();

}

}

void enqueue(int a)

{

printf("\nEnter the element to be inserted:");

scanf("%d",&a);

if(rear==n)

printf("Queue become overflow");

else

{

front=0;

rear=rear+1;

queue[rear]=a;

}

menu();

}

void dequeue()

{

if(front==-1||front>rear)

printf("Queue is underflow");

else

{

printf("Dequeue element is %d",queue[front]);

front=front+1;

}

menu();

}

void peek()

{

printf("Peek element is %d",queue[front]);

menu();

}

void display()

{

if(front==-1)

printf("Queue is empty");

else

{

printf("Queue is:\n");

for(int i=front;i<=rear;++i)

{

printf("%d\t",queue[i]);

printf("\n");

}

}

menu();

}