PART B-1 . Write a C Program to sort the given list using quick sort technique.

 
 

 
 PART-B
 4. Write a C Program to implement a Circular queue
 
  
#include < stdio.h>
#include < conio.h>
 
#define MAX_SIZE 5

    
    int queue[MAX_SIZE];
int front = -1, rear = -1;

 
int isFull()
{
     
    return (rear + 1) % MAX_SIZE == front;
}

 
int isEmpty()
{
    
    return front == -1;
}

 
void enqueue(int data)
{
    
    if (isFull()) {
        printf("Queue overflow\n");
        return;
    }
    
    if (front == -1) {
        front = 0;
    }
    
    rear = (rear + 1) % MAX_SIZE;
    queue[rear] = data;
    printf("Element %d inserted\n", data);
}

 
int dequeue()
{
    
    if (isEmpty()) {
        printf("Queue underflow\n");
        return -1;
    }
   
    int data = queue[front];
   
    if (front == rear) {
        front = rear = -1;
    }
    else {
         
 
        front = (front + 1) % MAX_SIZE;
    }
    
    return data;
}

 
void display()
{
     
    if (isEmpty()) {
        printf("Queue is empty\n");
        return;
    }
   
    printf("Queue elements: ");
    int i = front;
    while (i != rear) {
        printf("%d ", queue[i]);
        i = (i + 1) % MAX_SIZE;
    }
     
    printf("%d\n", queue[rear]);
}

 
void main()
{
    
    enqueue(10);
    enqueue(20);
    enqueue(30);
    
    display();

    
    printf("Dequeued element: %d\n", dequeue());
     
    display();

    
  getch();
}