programming

i want some more program on some other technology like as .net and java

binary searching

//* wap a program of binary searching *//

#include
#include
int BinarySearch(int Array[], int Value)
{
int First,Last,Mid;
First=0;
Last=9;
while(First<=Last)
{
Mid=(First+Last)/2;
if(Value==Array[Mid])
return(Mid);
else
if(Value Last=Mid-1;
else
if(Value>Array[Mid])
First=Mid+1;
}
return(-1);
}
void main()
{
int Array[10]={19,32,131,223,287,363,372,373,447,452};
int a,Value,pos;
clrscr();
printf("\n\n Ur List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);

printf("\n\n\n Which Value U want To Find : ");
scanf("%d",&Value);

pos=BinarySearch(Array,Value);

if(pos==-1)
printf("\n\n\n Value Does Not Exist");
else
printf("\n\n\n Value Found At Position %d",pos+1);

getch();
}

linear searching

//* wap a program of linear searching *//

#include
#include
int LinearSearch(int Array[], int Value)
{
int a;
for(a=0;a<10;a++)
if(Value==Array[a])
return(a);

return(-1);
}
void main()
{
int Array[10]={19,32,31,23,87,63,72,73,7,52};
int a,Value,pos;
clrscr();
printf("\n\n Ur List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);

printf("\n\n\n Which Value U want To Find : ");
scanf("%d",&Value);

pos=LinearSearch(Array,Value);

if(pos==-1)
printf("\n\n\n Value Does Not Exist");
else
printf("\n\n\n Value Found At Position %d",pos+1);

getch();
}

merge sorting

//* wap a program of merge sorting *//

#include
#include
void Sort(int Array[],int First,int Last)
{
int a,b,t;
for(a=First;a {
for(b=a+1; b<=Last;b++)
{
if(Array[a] > Array[b])
{
t=Array[a];
Array[a]=Array[b];
Array[b]=t;
}
}
}
}

void main()
{
int Array[10]={89,43,63,43,94,5,34,63,12,3};
int PairSize,Size=9,a;
clrscr();
printf("\n Ur Unsorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);
//-------------------------------------
PairSize=1;
do
{
PairSize=PairSize*2;
for(a=0;a {
if(a+PairSize<=Size)
Sort(Array,a,a+PairSize);
else
Sort(Array,a,Size);
}
}while(PairSize<=Size);


//-------------------------------------
printf("\n\n\n\n Ur Sorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);

getch();
}

insertion sorting

//* wap a program of insertion sorting *//

#include
#include
void main()
{
int Array[10]={89,43,63,43,94,5,34,63,12,3};
int a,b,t;
clrscr();
printf("\n Ur Unsorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);
//-------------------------------------

for(a=0;a<9;a++)
{
for(b=1+a; b>=1;b--)
{
if(Array[b] < Array[b-1])
{
t=Array[b];
Array[b]=Array[b-1];
Array[b-1]=t;
}
}
}

//-------------------------------------
printf("\n\n\n\n Ur Sorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);

getch();
}

bubble sorting

//* wap a program of bubble sorting *//

#include
#include
void main()
{
int Array[10]={89,43,63,43,94,5,34,63,12,3};
int a,b,t;
clrscr();
printf("\n Ur Unsorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);
//-------------------------------------

for(a=0;a<9;a++)
{
for(b=0; b<9-a;b++)
{
if(Array[b] > Array[b+1])
{
t=Array[b];
Array[b]=Array[b+1];
Array[b+1]=t;
}
}
}

//-------------------------------------
printf("\n\n\n\n Ur Sorted List : ");
for(a=0;a<10;a++)
printf(" %d",Array[a]);

getch();
}

selection sorting

//* wap a program of selection sort *//

#include
#include
void main()
{
int array[20];
int i,j,n,temp;
clrscr();
printf("enter size of an array ");
scanf("%d",&n);
for(i=0;i {
scanf("%d",&array[i]);
}
for(i=0;i {
for(j=i+1;j {
if(array[i]>=array[j])
{
temp=array[i];
array[i]=array[j];
array[j]=temp;
}
}
}
printf("\n\nsorted array is ........");
for(i=0;i {
printf("\n\n %d",array[i]);
}

getch();
}