Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

how to find greatet of 10 numbers without using array?

Answer Posted / afreen chitragar

int main()
{
int i, num;
int greatest=0;

for(i=0; i<10; i++)
{
scanf("%d", &num);
if(num > greatest)
greatest = num;
}
printf("greatest = %d", greatest);
return 0;
}

Is This Answer Correct ?    1 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

How many data structures are there in c?

1099


How is = symbol different from == symbol in c programming?

1027


what is use of malloc and calloc?

1891


Why c language?

1040


Where can I get an ansi-compatible lint?

1127


what will be maximum number of comparisons when number of elements are given?

1888


What is methods in c?

1066


What would be an example of a structure analogous to structure c?

979


Is it better to bitshift a value than to multiply by 2?

1081


Explain what is wrong in this statement?

1111


What are inbuilt functions in c?

1022


how to construct a simulator keeping the logical boolean gates in c

2244


What is the difference between single charater constant and string constant?

1073


What is quick sort in c?

1071


What is the purpose of the following code? Is there any problem with the code? void send(int count, short *to, short *from) { /* count > 0 assumed */ register n = (count + 7) / 8; switch (count % 8) { case 0: do { *to = *from++; case 7: *to = *from++; case 6: *to = *from++; case 5: *to = *from++; case 4: *to = *from++; case 3: *to = *from++; case 2: *to = *from++; case 1: *to = *from++; } while (--n > 0); } }

2486