GTU Data Structure Practical - 12
Write a program to implement Queue Sort
				
					#include<stdio.h>

#include<conio.h>

#include <stdlib.h>

#define n 5
void main() {
  int queue[n], ch = 1, front = 0, rear = 0, i, j = 1, x = n;
  //clrscr();
  printf("Queue using Array");
  printf("\n1.Insertion \t2.Deletion \t3.Display \t4.Exit");
  while (ch) {
    printf("\nEnter the Choice:");
    scanf("%d", & ch);
    switch (ch) {
    case 1:
      if (rear == x)
        printf("\n Queue is Full");
      else {
        printf(" Enter no %d:", j++);
        scanf("%d", & queue[rear++]);
      }
      break;
    case 2:
      if (front == rear) {
        printf("\n Queue is empty");
      } else {
        printf("\n Deleted Element is %d", queue[front++]);
        x++;
      }
      break;
    case 3:
      printf("\n Queue Elements are:\n ");
      if (front == rear)
        printf("\n Queue is Empty");
      else {
        for (i = front; i < rear; i++) {
          printf("%d", queue[i]);
          printf("\t");
        }
        break;
        case 4:
          exit(0);
        default:
        printf("Wrong Choice: please see the options");
      }
    }
  }
  getch();
}
				
			
Output
C Program to Implement Queue Sort