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...

write a program to print only the largest number between
elements of an 1-d array?

Answer Posted / manjesh

at first suppost the 1st element of array is max among them
. now we compare max to others starts fron 2nd element if
max>number then check to next number otherwise swap both
number . at last u will found maximun no. among them

Is This Answer Correct ?    0 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Write a java program to print the subsets of a string

2493


how to implement spiral model on railway reservation?.

3040


How to work Air cooled and water cooled chiller?

1830


Reverse the link list without creating new list ?

2676


boolean isBadBoy(boolean hasGirlFriend , boolean isMarried, int age , String middleName , String lastName , String[] brotherName);

2163


how much the percentile as a good percentile in elitmus.

6738


How to freely move a ball in graphics mode.

2465


what is difference between shell commands and shell scripting commands or both r same?

2123


Why do windmills never appear stationary?

1517


i opt cse branch in engineering.which subject i have choose in civil service preliminary examination

2043


difference between tcp ip and open system interconnection

2643


what is a query for divide a table into two subtable?

2103


What is the meaning of int p(char*a);

1168


how will u recieve an std idoc from sendor->reciever

2009


discus the worst and best case complexity of binary search

1875