Answer:
35
Explanation:
Binary search is more efficient than linear search,time complexity of binary is 0(logn) where as linear's 0(n).In binary search we search from the middle of the array,whereas in linear we start with index 0 until the last.
4
35
44
98
List contains 4 elements, for finding the middle element we will divide by 2 .
4/2=2 so at the index 2 -35 is present ,we will start checking from 35.
The answer is false because you can change the margin size on words documents.
Answer:
int main() {
int n;
cout<<"Enter the integer n"<<endl;
cin>>n;
if(n<1 || n>10)
{
while(n>10 || n<1)//taking input if the number is not within range..
{
cout<<"Enter the number again"<<endl;
cin>>n;
}
activity(n);//calling activity with the n..
}
return 0;
}
Explanation:
Above written is the main function in which a prompting an integer between 1 and 10 if it is not within range then again taking input.Then after that calling activity with n as argument.
Answer:
No.
Explanation:
From my knowledge, negative 8 is 8 units to the left of zero, while 21 is 21 units to the left.
This means that they are two different negative numbers! If you see an equation like this, it would be labeled as false.
I'm quite sure I am correct, tell me so if otherwise! :)
#SpreadTheLove
Answer:
False.
Explanation:
Even if the web page does not have copyright protection it is unethical to cut and paste sections of the page into your speech without citing the source.It is definitely plagiarism.You are copying content from other sources and representing the mas your own.So we conclude that the answer is false.
