Answer:
see explaination
Explanation:
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
double temp1,temp2,inc,cel;
int i=1;
while(i==1)
{
i=0;
cin>>temp1>>temp2>>inc;
if(temp2<temp1||inc<=0)
{
i=1;
cout<<"Starting temperature must be <= ending temperature and increment must be >0.0\n";
}
}
cout<<endl;
cout<<setw(15)<<"Fahrenheit"<<setw(15)<<"Celsius";
while(temp1<=temp2)
{
cel=(temp1-32)/1.8;
cout<<endl;
cout<<fixed<<setprecision(3)<<setw(15)<<temp1<<setw(15)<<cel;
temp1+=inc;
}
}
Please kindly check attachment for output.
Answer:
<u> A. It uses binary numbers in its algorithm</u>
Explanation:
A Binary search is a type of algorithm designed to look through <em>only </em>a sorted array of data for a particular item.
It is<em> more efficient (faster) </em>than sequential search since the algorithm doesn't have to look up the entire array of data, but simply repeatedly divide in half the section of the array that could contain the searched item.
Answer:
the answer would be there
Explanation: