Insert - Header - choose header of your choice. Page numbers are below the Header icon
int main {
//variables
unsigned long num = 0;
std::string phrase = " Please enter your name for confirmation: " ;
std::string name;
//codes
std::cout << phrase;
std::cin>> name;
while ( serial.available() == 0 ) {
num++;
};
if ( serial.avaliable() > 0 ) {
std::cout << " Thank you for your confirmation ";
};
};
Answer:
B. She created a person website with a unique URL for her online portfolio
Explanation:
Answer:
True: In binary search algorithm, we follow the below steps sequentially:
Input: A sorted array B[1,2,...n] of n items and one item x to be searched.
Output: The index of x in B if exists in B, 0 otherwise.
- low=1
- high=n
- while( low < high )
- { mid=low + (high-low)/2
- if( B[mid]==x)
- {
- return(mid) //returns mid as the index of x
- }
- else
- {
- if( B[mid] < x) //takes only right half of the array
- {
- low=mid+1
- }
- else // takes only the left half of the array
- {
- high=mid-1
- }
- }
- }
- return( 0 )
Explanation:
For each iteration the line number 11 or line number 15 will be executed.
Both lines, cut the array size to half of it and takes as the input for next iteration.
