Notes

CIRCULAR QUEUE:
#include <stdio.h>
#define SIZE 5

int items[SIZE];
int front = -1, rear = -1;
int isFull() {
if ((front == rear + 1) || (front == 0 && rear == SIZE - 1)) return 1;
return 0;
}
int isEmpty() {
if (front == -1) return 1;
return 0;
}
void enQueue(int element) {
if (isFull())
printf("n Queue is full!! n");
else {
if (front == -1) front = 0;
rear = (rear + 1) % SIZE;
items[rear] = element;
printf("n Inserted -> %d", element);
}
}
int deQueue() {
int element;
if (isEmpty()) {
printf("n Queue is empty !! n");
return (-1);
} else {
element = items[front];
if (front == rear) {
front = -1;
rear = -1;
}
else {
front = (front + 1) % SIZE;
}
printf("n Deleted element -> %d n", element);
return (element);
}
}
void display() {
int i;
if (isEmpty())
printf(" n Empty Queuen");
else {
printf("n Front -> %d ", front);
printf("n Items -> ");
for (i = front; i != rear; i = (i + 1) % SIZE) {
printf("%d ", items[i]);
}
printf("%d ", items[i]);
printf("n Rear -> %d n", rear);
}
}

int main() {
deQueue();

enQueue(1);
enQueue(2);
enQueue(3);
enQueue(4);
enQueue(5);
enQueue(6);
display();
deQueue();
display();
enQueue(7);
display();
enQueue(8);
return 0;
}
______________________________________________________________________________________________________________________________________________________________________
CIRCULAR LINKED LIST

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct node{
int data;
struct node *next;
};
struct node *head = NULL;
struct node *tail = NULL;
void add(int data){
struct node *newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = data;
if(head == NULL){
head = newNode;
tail = newNode;
newNode->next = head;
}else {
tail->next = newNode;
tail = newNode;
tail->next = head;
}
}
void display(){
struct node *current = head;
if(head == NULL){
printf("List is empty");
}
else{
printf("Nodes of the circular linked list: n");
do{
printf("%d ", current->data);
current = current->next;
}while(current != head);
printf("n");
}
}

int main()
{
add(1);
add(2);
add(3);
add(4);
display();
return 0;
}
________________________________________________________________________________________________________________________________________________________________
BUBBLE SORT

#include <stdio.h>

int main()
{
int array[100], n, c, d, swap;

printf("Enter number of elementsn");
scanf("%d", &n);

printf("Enter %d integersn", n);

for (c = 0; c < n; c++)
scanf("%d", &array[c]);

for (c = 0 ; c < n - 1; c++)
{
for (d = 0 ; d < n - c - 1; d++)
{
if (array[d] > array[d+1])
{
swap = array[d];
array[d] = array[d+1];
array[d+1] = swap;
}
}
}

printf("Sorted list in ascending order:n");

for (c = 0; c < n; c++)
printf("%dn", array[c]);

return 0;
}
___________________________________________________________________________________________________________________________________________________________________
QUICK SORT

#include <stdio.h>

void swap(int *a, int *b) {
int t = *a;
*a = *b;
*b = t;
}
int partition(int array[], int low, int high) {
int pivot = array[high];
int i = (low - 1);
for (int j = low; j < high; j++) {
if (array[j] <= pivot) {
i++;

swap(&array[i], &array[j]);
}
}
swap(&array[i + 1], &array[high]);
return (i + 1);
}

void quickSort(int array[], int low, int high) {
if (low < high) {
int pi = partition(array, low, high);
quickSort(array, low, pi - 1);
quickSort(array, pi + 1, high);
}
}
void printArray(int array[], int size) {
for (int i = 0; i < size; ++i) {
printf("%d ", array[i]);
}
printf("n");
}
int main() {
int data[] = {8, 7, 2, 1, 0, 9, 6};

int n = sizeof(data) / sizeof(data[0]);

printf("Unsorted Arrayn");
printArray(data, n);
quickSort(data, 0, n - 1);
printf("Sorted array in ascending order: n");
printArray(data, n);
}