Sunday, 8 January 2012

largest and smallest


#include<stdio.h>
#include<conio.h>
main()
{
int a[5],i,large=0,small=a[0];
clrscr();
printf("enter 5 number");
for(i=0;i<5;i++)
{
printf("\nenter %d number",i);
scanf("\n%d",&a[i]);
}
printf("\nentered number are") ;
for(i=0;i<5;i++)
{
printf("\t%d",a[i]);

if(a[i]>large)
large=a[i];
if(a[i]<small)
small=a[i];
}

printf("\nlargest number %d",large);
printf("\nsmallest number %d",small);

getch();
return 0;
}                       //output
enter 5 number
enter 0 number
1

enter 1 number2

enter 2 number3                                                                 
                                                                                
enter 3 number4                                                                 
                                                                                
enter 4 number5                                                                 
                                                                                
entered number are      1       2       3       4       5                       
largest number 5                                                                
smallest number 1                                                               
                                                                                
                                                                                
                                                                                
                                                                                
                                                                                
                                                                                
                                                                                
                                                                                
                                                                                
                                                                                

No comments:

Post a Comment