Implementation of Priority Queue

Implementation of Priority Queue 

CODE

👇

1. #include<stdio.h>
2. #define MAX 50
3. typedef struct
4. {
5. int data[MAX];
6. int front,rear;
7. }QUEUE;
8. 
   
9. void InitQ(QUEUE *pq)
10. {
11.   pq->front = pq->rear = -1;
12. }
13. 
    
14. void AddQ(QUEUE *pq, int num)
15. {
16. int i;
17. for(i=pq->rear;i>pq->front;i--)
18.     if(num>pq->data[i])
19.   pq->data[i+1]=pq->data[i];//shift element
20.         else
21.         break;
22.        pq->data[i+1]=num;
23.        pq->rear++;
24. }
25. 
    
26. int DelQ(QUEUE *pq)
27. {
28. int num;
29.   pq->front++;
30.   num=pq->data[pq->front];
31.     return(num);
32. }
33. 
    
34. int isempty(QUEUE *pq)
35. {
36. return(pq->front == pq->rear);
37. }
38. 
    
39. int isfull(QUEUE *pq)
40. {
41.   return(pq->rear==MAX-1);
42. }
43. 
    
44. void main()
45. {
46.   int num,choice;
47.   QUEUE q1;
48.   InitQ(&q1);
49.   printf(">>Implementation of Priority Queue<<");
50.   do
51.   {
52.     printf("\n1: Add \n");
53.     printf("2: Delete \n");
54.     printf("3: Exit \n");
55.     printf("Enter Your Choice: \t");
56.     scanf("%d",&choice);
57. 
    
58.     switch(choice)
59.     {
60.       case 1: printf("Enter Element To Be Added:\t");
61.       scanf("%d",&num);
62.       if(isfull(&q1))
63.       printf("\t>>Queue Overflow<<\n");
64.       else
65.       AddQ(&q1,num);
66.       break;
67. 
    
68.       case 2: if(isempty(&q1)==1)
69.       printf("\t>>Queue Is Empty<<\n");
70.       else
71.       printf("The Deleted Element Is:\t %d \n",DelQ(&q1));
72.       break;
73. 
    
74.       case 3: printf("\t>>END<<");
75.       break;
76.      
77.       default:printf("\t>>Enter Right Choice<<");
78.     }
79.   }
80.  while(choice!=3);
81. }

👉Excute👈

//Output

/*

>>Implementation of Priority Queue<<

1: Add

2: Delete

3: Exit

Enter Your Choice:      2

        >>Queue Is Empty<<

1: Add

2: Delete

3: Exit

Enter Your Choice:      1

Enter Element To Be Added:      5

1: Add

2: Delete

3: Exit

Enter Your Choice:      2

The Deleted Element Is:  5

1: Add

2: Delete

3: Exit

Enter Your Choice:      4

        >>Enter Right Choice<<

1: Add

2: Delete

3: Exit

Enter Your Choice:      3

        >>END<<

*/

                                                           //ThE ProFessoR