Answer:
<u> A. It uses binary numbers in its algorithm</u>
Explanation:
A Binary search is a type of algorithm designed to look through <em>only </em>a sorted array of data for a particular item.
It is<em> more efficient (faster) </em>than sequential search since the algorithm doesn't have to look up the entire array of data, but simply repeatedly divide in half the section of the array that could contain the searched item.
Explanation:
A map is the correct answer hope that helps you.
Answer:
Following are the statement in C++ language :
#include <iomanip> // header file
using namespace std; // namespace
int main() // main method
{
int x1,x2,x3,x4,x5; // variable declaration
cout<<" Enter the 5 sucessive integer:";
cin>>x1>>x2>>x3>>x4>> x5; // taking 5 input from user
cout<<right;
// prints each of its own line and form a right-justified
cout<<setw(5)<< x1 << "\n" << setw(5) << x2 << "\n" <<setw(5) << x3 << "\n" << setw(5) << x4 << "\n" << setw(5) << x5 << "\n";
return(0);
}
Output:
Enter the 5 sucessive integer: 45
23
445
6
8
45
23
445
6
8
Explanation:
Description of program is given below
- Declared a 5 integer value x1,x2,x3,x4,x5 respectively.
- Read the 5 integer value from user by using cin funtion.
- Finally Print these 5 value in its own line and form a right-justified by using setw() function on it
