C-PROGRAM FOR BINARY SEARCH USING RECURSIVE FUNCTION

#include
#include
int key;
void main()
{
int a[50],i,n,loc;
int bin();
printf("\nenter the size of the array");
scanf("%d",&n);
printf("%d\n",n);
printf("\narray elements?\n\n");
for(i=0;i
scanf("%d",&a[i]);
for(i=0;i
printf("%5d",a[i]);
printf("\n");
printf("\nelement to be searched");
scanf("%d",&key);
printf("\n%d",key);
loc=bin(a,0,n);
printf("\n\n");
if(loc==0)
printf("\nunsuccessful search %d not found\n",key);
else
{
printf("\nsuccessful search");
printf("\n%d found at position %d \n",key,loc);
}
getch();
}

C-PROGRAM FOR BINARY SEARCH

#include
#include
void main()
{
int a[100],i,n,low,high,mid,term,flag=1;
printf("\nnumber of elements in the array?");
scanf("%d",&n);
printf("%d",n);
printf("\n\nenter elements in ascending order:\n");
for(i=0;i<=high) { mid=(low+high)/2; if(terma[mid])
low=mid+1;
else
if(term==a[mid])
{
printf("\nsearch successful");
printf("\n%d found at location %d\n",term,mid+1);
flag=0;
break;
}
}
if(flag==1)
printf("\nsearch unsuccessful");
getch();
}

C-PROGRAM FOR QUICK SORT

#include
void quick(int a[],int,int);
void main()
{
int a[20],i,j,n,l,u;
printf("\nenter size of the array");
scanf("%d",&n);
printf("\nenter elements of the array");
for(i=0;ip)
j--;
if(i<=j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
else
{
temp=a[j];
a[j]=a[l];
a[l]=temp;
}
quick(a,l,j-1);
quick(a,j+1,u);
}
}
}

C-PROGRAM FOR MERGE SORT

#include
#include
void main(void)
{
int i,j,k,l,m,n,a[20],b[20],c[20];
printf("\nenter the array1 size");
scanf("%d",&m);
printf("\nenter %d elements",m);
for(i=0;i<=m;i++)
scanf("%d",&a[i]);
sort_array(a,m-1);
printf("\nsorted arra1:");
for(i=0;i<=m;i++)
printf("\t%d",a[i]);
printf("\nenter the array2 size:");
scanf("%d",&n);
printf("\nenter %d elements:",n);
for(i=0;i<=n;i++)
printf("\t%d",&b[i]);
sort_array(b,n-1);
printf("\nsorted array 2:");
for(i=0;i<=n;i++)
printf("\t%d",b[i]);
i=j=k=0;
while((i if(a[i] < b[j])
{
c[k]=a[i];
i++;
k++;
}
else
{
if(a[i]>b[j])
{
c[k]=b[j];
j++;
k++;
}
else
{
c[k]=a[i];
i++;
j++;
k++;
}
}
if(i {
for(i=1;i {
c[k]=a[i];
i++;
k++;
}
}
else
if(j {
for(i=j;i {
c[k]=b[j];
j++;
k++;
}
}
printf("\nmerged array is:");
for(i=0;i printf("\t %d",c[i]);
}

void sort_array(int sa[20],int x)
{
int i,flag,temp;
flag=0;
while(flag==0)
{
flag=1;
for(i=0;i {
if(sa[i]>sa[i+1])
{
temp=sa[i];
sa[i]=sa[i+1];
sa[i+1]=temp;
flag=0;
}
}
}
}

C-PROGRAM FOR BUBBLE SORT

/*bubble sort*/
#include
#include
void main()
{
int i,j,k,n,flag,limit,a[50];
printf("number of array elements?");
scanf("%d",&n);
printf("%d",n);
printf("\nenter array elements");
for(i=0;ia[j+1])
{
k=a[j];
a[j]=a[j+1];
a[j+1]=k;
flag=0;
}
}
if(flag)
break;
else
flag=1;
}
printf("\nsorted array:\n");
for(i=0;i
printf("\n%5d",a[i]);
printf("\n");
getch();
}

BEST WEBSITES USEFULL TO EVERY ONE

http://ecmrocks.synthasite.com/resources/Best_Websites_list.xls

PROGRAM FOR IMPLEMENTING QUEUE USING LINKED LIST

#include
#include
#include
#define NULL 0
struct queue
{
int info;
struct queue *next;
};
typedef struct queue node;
node *first,*list,*front,*rear;
void add();
void del();
void print();
void main()
{
int ch;
front=rear=NULL;
do
{
printf("\n 1->add");
printf("\n 2->del");
printf("\n 3->exit");
printf("\n Enter choice");
scanf("%d",&ch);
switch(ch)
{
case 1: add();
print();
break;
case 2: del();
print();
break;
case 3: exit(0);
break;
default: printf("Invalid choice");
}
}while(ch!=3);
}
void add()
{
first=(node *)malloc(sizeof(node));
printf("Enter element");
scanf("%d",&first->info);
first->next=NULL;
if(rear==NULL)
{
rear=first;
front=first;
}
else
rear->next=first;
rear=first;
}

void del()
{
if(front==NULL)
{
printf("\nList is empty\n");
getch();
}
else
{
printf("The popped element is %d \n ",front->info);
if(front==rear)
{
front=NULL;
rear=NULL;
}
else
front=front->next;
}
}

void print()
{
list=front;
if(list==NULL)
{
printf("\nList is empty\n");
}
else
{
printf("\nfront->");
while(list!=rear)
{
printf("%d->",list->info);
list=list->next;
}
printf("%d->",list->info);
printf("rear\n");
}
}