Friday, 15 November 2013

C program for linear search


#include<stdio.h>
int main()
{
int a[10],i,n,m,c=0;
printf("enter the size of an array : ");
scanf("%d",&n);
printf("enter the elements of an array: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("enter the number to be search: ");
for(i=0;i<n-1;i++)
{
if(a[i]==m)
{
c=1;
break;
}
}
if(c==0)
{
printf("the no. is not in the list");
else
printf("the no. is found");
}
return 0;
}

Sunday, 3 November 2013

c program for selection sort



#include<stdio.h>
int main()
{
int i,j,n,temp,a[20]
Printf("enter number of elements : ");
Scanf("%d",&n);
Printf(" enter the elements")
for(i=0;i<=n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)

Friday, 1 November 2013

C Program for Insertion sort




#include<stdio.h>

int main()
{
int i,j,n,temp,a[20] ;
printf("enter number of elements :");
scanf("%d",&n);
printf("enter %d elements :",n);
for(i=0;i<n;i++)
{
temp=a[i];

Thursday, 9 February 2012

Program to find largest of two numbers using Function/Recursion.





#include<conio.h>
#include<conio.h>
void main()
{
float large(float,float);/*Function declaration*/
float x,y,l;
clrscr();
printf("enter two numbers\n");
scanf("%f%f",&x,&y);
printf("x=%f and y=%f\n",x,y);
l=large(x,y); /*Function reference*/

Saturday, 21 January 2012

To Add first n numbers using Function / Recursion



#include<stdio.h>
#include<conio.h>
void main()
{
int sum(int);
int n,s;
clrscr();
printf("enter n numbers\n");
scanf("%d",&n);
s=sum(n);

To find maximum of two no.s using Function / Recursion


#include<stdio.h>
#include<conio.h>
void main()
{
int max(int,int);
int x,y,m;
clrscr();
printf("enter two numbers\n");
scanf("%d%d",&x,&y);
m=max(x,y);

To find Square of a no. using Function / Recursion.


#include<stdio.h>
#include<conio.h>
void main()
{
float square(float);
float n,s;
clrscr();
printf("enter a number:");

Sunday, 15 January 2012

Program to reverse a String.


#include<stdio.h>
#include<conio.h>
void main()
{
char str[10],revstr[10];
int n,count,i;
clrscr();
printf("enter the no. of characters in string\n");

Saturday, 14 January 2012

To find the FACTORIAL of a number using RECURSION


#include<stdio.h>
#include<conio.h>
void main()
{
int fact(int);
int n,f;
clrscr();
printf("enter a no.\n");
scanf("%d",&n);

To find the n FIBONACCI number using RECURSION


#include<stdio.h>
#include<conio.h>
void main()
{
int fibo(int);
int n,f;
clrscr();
printf("enter the limit\n");
scanf("%d",&n);
f=fibo(n);

GCD and LCM of two numbers.


#include<stdio.h>
#include<conio.h>
void main()
{
int m,n,p,q,r,gcd,lcm;
clrscr();
printf("enter two no.s");
scanf("%d%d",&m,&n);
p=m;
q=n;
while(n!=0)
{
r=m%n;
m=n;
n=r;
}
gcd=m;
lcm=(p*q)/gcd;
printf("gcd(%d,%d)=%d\n",p,q,gcd);
printf("lcm(%d,%d)=%d\n",p,q,lcm);
getch();
}

For 8051 microcontroller programming :http://assemblylanguage8051.blogspot.in/


Jai Ho - HD Hindi Movie Digital Poster [2014] Salman Khan by A-Music