Answer:
// here is code in C++.
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variables
int x=5,y=2,z=9;
int min;
// find the smallest value and assign to min
// if x is smallest
if(x < y && x < z)
// assign x to min
min=x;
// if y is smallest
else if(y < z)
// assign y to min
min=y;
// if z is smallest
else
// assign z to min
min=z;
// print the smallest
cout<<"smallest value is:"<<min<<endl;
return 0;
}
Explanation:
Declare and initialize variables x=5,y=2 and z=9.Then check if x is less than y and x is less than z, assign value of x to variable "min" .Else if value of y is less than value of z then smallest value is y, assign value of y to "min".Else z will be the smallest value, assign its value to "min".
Output:
smallest value is:2
Answer:
c) it will always return with an answer of 7 or fewer comparisons of data.
Explanation:
As maximum number of comparison in worst case for sorted binary search is log₂n, here n = 100, so maximum search is at least 6.6 which is approximately 7.
Answer:
It is a data type that only holds whole numbers, a.k.a. integers.
what is the picture about?
I believe the answer is in the question, web server. although I may be wrong
Create a bulleted list of four descriptive terms describing possible values a person may have.
* always be true to yourself
* honesty is the best policy
* making mistakes leads you to solutions
* it's ok to be wrong