//Bubble sort in 1-d array

#include<stdio.h>
#include<conio.h>
#define MAX 50
void main()
{
int arr[MAX],size,i,j,tmp;
clrscr();
printf("\nHow many elements to br included");
scanf("%d",&size);
printf("\n Enter elements in array");
for(i=0;i<size;i++)
scanf("%d",%arr[i]);
for(i=0;i<size-1;i++)
{
for(j=0;j<size-1-i;j++)
{
if(arr[j]>arr[i])
{
tmp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=tmp;
}
}
}
printf("\nThe sorted list is:");
for(i=0;i<size;i++)
printf("\n%d",arr[i]);
getch();
}

OUTPUT:
How many elements to be included 5.
Enter elements in array
44 33 55 22 11
The sorted list is:
11 22 33 44 55

//INSERTION IN 1-D ARRAY

#include <stdio.h>
#include <process.h>
#include <conio.h>
int findpos(int [],int,int);
void main()
{
int ar[50],item,n,index;
clrscr();
printf("How many element do u want to create array with ?");
scanf("%d",&n);
printf("\nEnter array element\n ");
for(int i=0;i<n;i++)
scanf("%d",&ar[i]);
char ch='y';
while(ch=='y'||ch=='Y')
{
printf("\nEnter element to be inserted") ;
scanf("%d",&item);
if(n==50)
{
printf("overflow\)";
exit(1);
}
index= findpos(ar,n,item) ;
for(i=n;i>index;i--)
{
ar[i]=ar[i-1];
}
ar[index]=item;
n+=1;
printf("\n Want to insert more element ?(y/n)") ;
scanf("%c",&ch);
}
printf("The array now is as shown below \n");
for(i=0;i<n;i++)
printf("%d ",ar[i]);
}
int findpos(int ar[] ,int size,int item)

{
int pos;
if(item <ar[0])
pos=0;
else
{
for(int i=0;i<size-1;i++)
{
if(ar[i]<=item&&item<ar[i+1])
{
pos=i+1;
break;
}
}
if(i==size-1)
pos=size;
}
return pos;
}

OUTPUT:
How many element do u want to create array with ?
6
Enter array element
2 6 9 10 12 15
Enter element to be inserted...
11
Want to insert more element?(y/n)...
y
Enter element to be inserted...
4
Want to insert more element?(y/n)...
n
The array now is as shown below ...
2 4 6 9 10 11 12 15

//Insertion sort in 1-d array

#include<stdio.h>
#include<conio.h>
#define max 50
void main()
{
int arr[max],size,i,j,tmp;
clrscr();
printf("\nHow many elements to be entered:");
scanf("%d",&size);
printf("\nEnter element in the array:");
for(i=0;i<size;i++)
scanf("%d",&arr[i]);
for(i=1;i<size;i++)
{
for(j=i-1;j>=0;j--)
{
if(arr[i]<arr[j])
{
tmp=arr[i];
arr[i]=arr[j];
arr[j]=tmp;
i=i-1;
}
}
}
printf("\nThe sorted list is:");
for(i=0;i<size;i++)
printf("%d\n",arr[i]);
getch();
}

OUTPUT:
How many elements to be entered: 7
Enter element in the array: 9 4 3 2 34 1 6
The sorted list is:
1 2 3 4 6 9 34

//program to find largest & smallest value in array

#include<stdio.h>
#include<process.h>
#include<conio.h>
void main()
{
int num[5],large,i;
clrscr();
printf("\nEnter nos. in an array");
for(i=0;i<5;i++)
scanf("%d",&num[i]);
large=num[0];
for(i=0;i<5;i++)
{
if(num[i]>large)
{
large=num[i];
printf("\n Largest no. is %d",large);
exit(0);
}
if(num[i]<large)
{
large=num[i];
printf("\n Smallest no. is %d",large);
exit(0);
}
}
getch();
}

OUTPUT:
Enter nos. in an array
23 45 67 89 10
Largest no. is 89
smallest no. is 10

//Program to find element in 1-d array using linear search

#include<stdio.h>
#include<conio.h>
void main()
{
int num[5],i,snum,count=0;
clrscr();
printf("\n Enter nos. in array");
for(i=0;i<5;i++)
scanf("%d",num[i]);
printf("\nEnter a no. to be searched:");
scanf("%d",&snum);
for(i=0;i<5;i++)
{
if(num[i]==snum)
{
count++;
}
}
if(count==0)
printf("\n No. is not found");
else
printf("\n No. is present %d times",count);
getch();
}

OUTPUT:
Enter no. in array
45 15 15 32 19
Enter no. to be searched: 15
No. is present in array 2 time

//Various operations on linked list

#include<stdio.h>
#include<conio.h>
#include<alloc.h>
#include<process.h>
void create();
void push();
void pop();
void disp();
void main()
{
int ch;
clrscr();
printf("\n CREATE---------1");
printf("\n PUSH-----------2");
printf("\n POP------------3");
printf("\n SHOW-----------4");
printf("\n EXIT-----------5");
printf("\n ENTER YOUR CHOICE(1-4)");
scanf("%d",& ch);
switch (ch)
{
case 1:
{
create();
main();
break;
}
case 2:
{
push();
main();
break;
}
case 3:
{

pop();
main();
break;
}
case 4:
{
disp();
main();
break;
}
case 5:
{
exit(0);
}
default:
{
printf("\n INVALID CHOICE");
break;
}
}
getch();
}
struct node
{
char name[20];
int roll;
struct node*ptr;
};
typedef struct node NODE;
NODE*first,*temp,*x;
int i,n,p=0;
void create()
{
clrscr();

printf("\n HOW MANY NODES YOU WANT TO CREATE");

scanf("%d",&n);
first=(NODE*)malloc(sizeof(NODE));
printf("\n ENTER DATA");
scanf("%s%d",first->name,first->roll);
first->ptr=NULL;
temp=first;
for(i=1;i<n;i++)
{
x=(NODE*)malloc(sizeof(NODE));
printf("\n ENTER DATA");
scanf("%s %d",x->name,& x->roll);
x->ptr=NULL;
temp->ptr=x;
temp=x;
}
getch();
}
void push()
{
int r,f=0;
printf("\n ENTER ROLLNO AFTER WHEN INSERTION IS DESIRED");
scanf("%d",& r);
temp=first;
while(temp->ptr!=NULL)
{
if(temp->roll==r)
{
x=(NODE*)malloc(sizeof(NODE));
printf("\n ENTER DATA");
scanf("%s %d",x->name,x->roll);
x->ptr=temp->ptr;
temp->ptr=x;
f=1;
break;
}
temp=temp->ptr;
}
if(f==0)
{

printf("\n NODE NOT FOUND");

}
getch();
}
void pop()
{
NODE*back;
int r,f=0;
printf("\n ENTER ROLLNO TO BE DELETED");
scanf("%d",&r);
temp=first;
while(temp->ptr!=NULL)
{
if(temp->roll==r)
{
f=1;
back->ptr=temp->ptr;
free (temp);
break;
}
back=temp;
temp=temp->ptr;
}
if(f==0)
{
printf("\n NODE NOT FOUND");
}
getch();
}
void disp()
{
temp=first;
while(temp!=NULL)
{
printf("\n %s %d",temp->name,temp->roll);
temp=temp->ptr;
}
getch();
}

OUTPUT:
CREATE---------1
PUSH-----------2
POP------------3
SHOW-----------4
EXIT-----------5
ENTER YOUR CHOICE(1-4)1
HOW MANY NODES YOU WANT TO CREATE
4
ENTER DATA
ashima
1
ENTER DATA
ram
2
ENTER DATA
kanika
3
ENTER DATA
aman
4
CREATE---------1
PUSH-----------2
POP------------3
SHOW-----------4
EXIT-----------5
ENTER YOUR CHOICE(1-4)2
ENTER ROLLNO AFTER WHEN INSERTION IS DESIRED
3
ENTER DATA
Suman
5

CREATE---------1
PUSH-----------2
POP------------3
SHOW-----------4
EXIT-----------5
ENTER YOUR CHOICE(1-4)2
ENTER ROLLNO AFTER WHEN INSERTION IS DESIRED
6
NODE NOT FOUND

CREATE---------1
PUSH-----------2
POP------------3
SHOW-----------4
EXIT-----------5
ENTER YOUR CHOICE(1-4)3
ENTER ROLLNO TO BE DELETED
3

CREATE---------1
PUSH-----------2
POP------------3
SHOW-----------4
EXIT-----------5
ENTER YOUR CHOICE(1-4)2
ENTER ROLLNO TO BE DELETED
6
NODE NOT FOUND
CREATE---------1
PUSH-----------2
POP------------3

SHOW-----------4
EXIT-----------5
ENTER YOUR CHOICE(1-4)2
ENTER ROLLNO TO BE DELETED
3
CREATE---------1
PUSH-----------2
POP------------3
SHOW-----------4
EXIT-----------5
ENTER YOUR CHOICE(1-4)4
ashima
1
ram
2
kanika
3
aman
4

//Program to merge two array in third array

#include<stdio.h>
#include<conio.h>
#define MAX 50
void main()
{
int arrA[MAX,arrB[MAX],arrC[MAX];
int mn,m,n,i,j,k;
clrscr();
printf("\nHow many element in array1");
scanf("%d",&m);
printf("\n How many elements in array 2");
scanf("%d",&n);
mn=m+n;
printf("\n Enter elements in array 1");
for(i=0;i<m;i++)
scanf("%d",arrA[i]);
printf("\nEnter elements in array 2");
for(i=0;i<n;i++)
scanf("%d",&arrB[i]);
while((i<=m-1)&&(j<=n-1))
{
if(arrA[i]<arrB[j])
{
arrC[k]=arrA[i];
i++;
}
else
{
arrC[k]=arrB[j];
j++;
}
k++;
}
while(i<=m-1)
{
arrC[k]=arrA[i];
i++;

k++;
}
while(j<=n-1)
{
arrC[k]=arrB[j];
j++;
k++;
}
printf("\nThe resultant array is:");
for(i=0[i<mn;i++)
printf("\n%d",arrC[i]);
getch();
}

OUTPUT:
How many elements in array 1
4
How many elements n array 2
3
Enter elements in array 1
1234
Enter elements in array 2
567
The resultant array is
1234567

//VARIOUS OPERATIONS ON QUEUE

#include<stdio.h>
#include<conio.h>
#include<process.h>
void push();
void pop();
void disp();
int q[100],i,front=0,rear=-1,item;
void main()
{
int ch;
clrscr();
printf("\n PUSH-----------1");
printf("\n POP------------2");
printf("\n SHOW-----------3");
printf("\n EXIT-----------4");
printf("\n ENTER YOUR CHOICE(1-4)");
scanf("%d",& ch);
switch (ch)
{
case 1:
{
push();
main();
break;
}
case 2:
{
pop();
main();
break;
}
case 3:

{
disp();
main();
break;
}
case 4:
{
exit(0);
}
default:
{
printf("\n INVALID CHOICE");
break;
}
}
getch();
}
void push()
{
if(rear==99)
{
printf("\n OVERFLOW");
}
else
{
rear++;
printf("\n Enter item");
scanf("%d",&item);
q[rear]=item;
}
}
void pop()
{
if(rear==-1)
{
printf("\n UNDERFLOW");

}
else
{
printf("DELETED ITEM IS %d",q[front]);
front++;
}
getch();
}
void disp()
{
for(i=front;i<=rear;i++)
{
printf("\n %d",q[i]);
}
getch();
}

OUTPUT:
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
1
Enter item
1
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
1
Enter item
2
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
1
Enter item
3
PUSH-----------1
POP------------2

SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)3
1
2
3
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)2
UNDERFLOW

PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)2
DELETED ITEM IS 1

//selection sort in 1-d array

#include<stdio.h>
#include<conio.h>
#define MAX 50
void main()
{
int a[MAX],n,i,j,tmp,ioc,min;
clrscr();
printf("\nHow many elements");
scanf("%d",&n);
printf("\nEnter elements in array");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<=n-1;i++)
{
min=a[i];
loc=i;
for(j=i+1;j<=n-1;j++)
{
if(a[i]<min)
{
min=a[j];
loc=j;
}
}
if(loc!=0)
{
tmp=a[i];
a[i]=a[loc];
a[loc]=tmp;
}
}
printf("\nArray after selection sort:");
for(i=0;i<=n-1;i++)
printf("%d",a[i]);
getch();
}

OUTPUT:
How many elements 7
Enter elements in array
15 6 13 22 3 52 2
Array after selection sort:
2 3 6 13 15 22 52

//VARIOUS OPERATIONS ON STACK

#include<stdio.h>
#include<conio.h>
#include<process.h>
void push();
void pop();
void disp();
int s[100],i,top=-1,item;
void main()
{
int ch;
clrscr();
printf("\n PUSH-----------1");
printf("\n POP------------2");
printf("\n SHOW-----------3");
printf("\n EXIT-----------4");
printf("\n ENTER YOUR CHOICE(1-4)");
scanf("%d",& ch);
switch (ch)
{
case 1:
{
push();
main();
break;
}
case 2:
{
pop();
main();
break;
}
case 3:

{
disp();
main();
break;
}
case 4:
{
exit(0);
}
default:
{
printf("\n INVALID CHOICE");
break;
}
}
getch();
}
void push()
{
if(top==99)
{
printf("\n OVERFLOW");
}
else
{
top++;
printf("\n Enter item");
scanf("%d",& item);
s[top]=item;
}
}
void pop()
{
if(top==-1)
{
printf("\n UNDERFLOW");

}
else
{
printf("\n DELETED ITEM IS %d",s[top]);
top--;
}
getch();
}
void disp()
{
for(i=0;i<=top;i++)
{
printf("\n %d",s[i]);
}
getch();
}

OUTPUT:
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
1
Enter item
1
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
1
Enter item
2
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
1
Enter item
3
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
2

UNDERFLOW
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
3
1
2
3
PUSH-----------1
POP------------2
SHOW-----------3
EXIT-----------4
ENTER YOUR CHOICE(1-4)
2
DELETED ITEM IS 3