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:
The program to this question can be described as follows:
Program:
#include <iostream> //defining header file
using namespace std;
int main() //defining main method
{
int x; //defining integer variable
for(x=0;x<=100;x++) //defining loop to count value from 0 to 100
{
if(x%7==0) //check value is divisable by 7
{
cout<<x<<endl; //print value
}
}
return 0;
}
Output:
please find the attachment.
Explanation:
In the above code, an integer variable x is declared, which is used in the for loop, in this loop variable "x" starts from 0 and ends when the value of x is less than and equal to 100.
- Inside the loop an, if block is used that defines a condition that is (i%7==0), it will check, that the value is divided by 7.
- In this loop, a print method is used, that prints its values.
Computer
a machine that processes information under the control of a program
Example(s)
(First Electronic Computer) The Electronic Numerical Integrator and Computer (ENIAC)
PC (Personal Computer)
Desktop
Laptop
Hope this helps!
It depends on what algorithm you’re using.
If you’re going item by item, you’ll be looking at O(n) or O(40000)
Give me a reply if you want to know more, such as if you did binary search what the Big O notation is