Answer:
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cout<<"enter the value of a:";
cin>>a;
cout<<"enter the value of b:";
cin>>b;
cout<<"enter the value of c:";
cin>>c;
cout<<"product is:"<<(a*b*c);
return 0;
}
Explanation:
Answer:
0 540 100 200 350 400 550 600 750
Explanation:
hope this helped
D I,II and III is the answer i think
Answer: 1 time.
Explanation:
- A binary function is also known as a half-interval search is a search algorithm to find the position of a given element x within a well-sorted array [].
- Binary search compares the target value to the middle element of the array.
- It ignores half of the elements just after one comparison.
- it compares x with the middle element.
So, the function read an element <u>one time</u> in the array before finding the value.
Answer:
do you still need the answer? or am i to lateeee
Explanation:
