Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Program to Implement Priority Queue using Min Heap
- #include <stdio.h>
- #include <conio.h>
- #define maxsize 20
- int elements[30],size=0;
- void display()
- {
- int i;
- for(i=1;i<=size;i++)
- {
- printf("\n%d",elements[i]);
- }
- }
- void insert (int x)
- {
- int i;
- if(size==0)
- {
- size++;
- elements[1]=x;
- }
- else if(size==maxsize)
- printf("\nQueue Full!");
- else
- {
- for(i=++size;elements[i/2]>x&&i/2!=0;i=i/2)
- elements[i]=elements[i/2];
- elements[i]=x;
- //printf("%d",size);
- }
- }
- int main()
- {
- int temp,ch;
- menu:
- printf("\nMenu:\n1. Insert Elements\n2. Display Heap\n3. Exit\nEnter Choice.....");
- scanf("%d",&ch);
- switch(ch)
- {
- case 1:
- do{
- printf("\nEnter the element: ");
- scanf("%d",&temp);
- insert(temp);
- printf("\nInsert More ? Yes (1) No (0)...");
- scanf("%d",&ch);
- }while(ch);
- break;
- case 2:
- display();
- break;
- case 3:
- printf("\nThank You!");
- getch();
- return 0;
- default:
- printf("\nInvalid choice!\n");
- goto menu;
- }
- goto menu;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement