Stacks Using Linked Lists

#include<stdio.h> #include<stdlib.h> typedef struct snode *sptr; struct snode {     int data;     sptr next; }; sptr top; void s...

Stacks Using Arrays

  #include<stdio.h> #include<stdlib.h> #define max 5 int top; int stack[max]; void push(int value) {     if(top==max-1)     {   ...

QUEUES Using Arrays

#include<stdio.h> #include<stdlib.h> #define size 5 int f,r; int Q[size]; void qinsert(int x) {     if(r==size-1)     {         ...

Insert Sort (Data Structures in C)

#include <stdio.h> #include <conio.h> int main() {     int n, i, j, swap;     int arr[80];     printf("Enter number of elem...

Bubble Sort (Data Structures in C)

  #include <stdio.h>  #include <conio.h> int main() {  int i,j,k,n,temp,arr[12],echg;     printf("enter the number of eleme...

Quick Sort

#include <stdio.h> #include <conio.h> void quicksort (int [], int, int); int main() {     int list[80];     int size, i;     pri...

Merge Sort (Data Structures in C)

#include <stdio.h> #include <conio.h> void mergeSort(int [], int, int, int); void partition(int [],int, int); int main() {     i...

Circular Queues Using Arrays (Data Structures in C)

#include<stdio.h> #include<stdlib.h> #define size 5 int f,r; int CQ[size]; void cqinsert(int x) {     if((r==size-1&&f==...