write a program on c(or)c++(or)java language i.e if i have 5
numbers like (10,24,3,9,15) i want to display highest number
from these numbers
Answers were Sorted based on User's Feedback
Answer / bhavesh gharat
#includ <conio.h>
#include <stdio.h>
void main()
{
int a[]={10,24,3,9,15};
int temp=a[0];
for(int i=1;i<a.length;i++)
{
if(temp<a[i])
{
temp=a[i];
}
}
printf(" higest no="+temp);
}
| Is This Answer Correct ? | 4 Yes | 1 No |
Answer / ashwek
/// Using C++
#include<iostream.h>
#include<conio.h>
int main(){
int arr[]={10,24,3,9,15};
int Max=arr[0];
for(int i=1; i<5; i++)
if(Max < arr[i]){
Max = arr[i];
cout<<"Higest number is = " <<Max;
return 0;
}
| Is This Answer Correct ? | 0 Yes | 0 No |
Write a program that prints the numbers from 1 to 100. But for multiples of three print "Fit" instead of the number and for the multiples of five print "Bit". For numbers which are multiples of both three and five print "FitBit".
3. . Explain the Cache memory? What is the advantage of a processor having more cache memory?
how we can connect applet with database?
how pseudo column works?
Given a arbitrary pointer to an element in a singly linked list?what is the time complexity for its deletion .
How many forms can you create in a Visual Basic 6 Standard EXE project? Is there any limit on that?
write a program on c(or)c++(or)java language i.e if i have 5 numbers like (10,24,3,9,15) i want to display highest number from these numbers
you have an unlimited supply of $3 and $7 poker chips. What is the largest integer value that you cannot make by combining different numbers of chips?
Data Structure: How many comparisons are necessary to find the largest and smallest of a set of n distinct elements?
Ordered List tag is
could u please also write an example of a code that involves instances from an abstract class just as u did for interfaces because u said it could also work which i really doubt. thanks
This is a puzzle question .... The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another. "In the prison is a switch room, which contains two light switches labeled A and B, each of which can be in either the 'on' or the 'off' position. I am not telling you their present positions. The switches are not connected to anything. "After today, from time to time whenever I feel so inclined, I will select one prisoner at random and escort him to the switch room. This prisoner will select one of the two switches and reverse its position. He must move one, but only one of the switches. He can't move both but he can't move none either. Then he'll be led back to his cell. "No one else will enter the switch room until I lead the next prisoner there, and he'll be instructed to do the same thing. I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may jump around and come back. "But, given enough time, everyone will eventually visit the switch room as many times as everyone else. At any time anyone of you may declare to me, 'We have all visited the switch room.' and be 100% sure. "If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch room, you will be fed to the alligators." What is the strategy they come up with so that they can be free?