| 8 | } pq[5],temp; |
| 9 | |
| 10 | void enqueue() |
| 11 | { |
| 12 | if(rear>=SIZE-1) |
| 13 | printf("\n Queue is full\n ------------- \n"); |
| 14 | else |
| 15 | { |
| 16 | int i; |
| 17 | if (front==-1) |
| 18 | front=rear=0; |
| 19 | |
| 20 | else |
| 21 | rear++; |
| 22 | |
| 23 | printf("\n Enter the element to be added:"); |
| 24 | scanf("%d",&pq[rear].val); |
| 25 | printf("\n Enter its priority:"); |
| 26 | scanf("%d",&pq[rear].priority); |
| 27 | |
| 28 | if(rear>0) |
| 29 | { |
| 30 | temp=pq[rear]; |
| 31 | for(i=rear-1;i>=0;i--) |
| 32 | if(temp.priority>pq[i].priority)//descending |
| 33 | pq[i+1]=pq[i]; |
| 34 | else |
| 35 | break; |
| 36 | pq[i+1]=temp; |
| 37 | |
| 38 | } |
| 39 | |
| 40 | } |
| 41 | } |
| 42 | void dequeue() |
| 43 | { |
| 44 | if(front==-1) |