Answer:
The following code as follows:
Code:
max=name1; //define variable max that holds name1 variable value.
if (strcmp(name2, max)>0) //if block.
{
max=name2; //assign value to max.
}
if (strcmp(name3,max)>0) //if block.
{
max=name3; //assign value to max.
}
Explanation:
In the above code, we define a variable that is max. The data type of max variable is the same as variables "name1, name2, and name3" that is "char". In the max variable, we assign the value of the name1 variable and use if block statement two times. In if block, we use strcmp() function that can be defined as:
- In first if block we pass two variables in strcmp() function that is "name2 and max" that compare string value. If the name2 variable is greater then max variable value so, the max variable value is change by name2 variable that is "max=name2".
- In second if block we pass two variables in strcmp() function that is "name3 and max" that compare string value. If the name3 variable is greater then max variable value so, the max variable value is change by name3 variable that is "max=name3".
Machine language is the language understood by a computer. It is very difficult to understand, but it is the only thing that the computer can work with. All programs and programming languages eventually generate or run programs in machine language
Answer:
B. The design and arrangement of items for efficiency and safety.
Explanation:
A "divide and conquer" approach known as binary search necessitates sorting the starting array first. Because the technique divides the array into two equal halves, it is called a binary algorithm. A binary search will initially examine the middle item in the array and evaluate it in relation to the search terms.
<h3>What exactly is binary search?</h3>
- Finding an element's location in a sorted array can be done using the searching method known as binary search.
- With this method, an array's middle is always searched for the element. Only on a list of things that has been sorted can binary search be used. If the elements are not sorted already, we need to sort them first.
- Binary search is used to find values in any sorted collection from any language library, including Java,.NET, C++ STL, etc.
- A sorted array can be searched using the binary search algorithm by continually halving the search interval. Utilizing the knowledge that the array is sorted, binary search attempts to minimize the time complexity to O (Log n).
To Learn more about binary search refer:
brainly.com/question/21475482
#SPJ4
Answer:
the digital document file which is printed on paper or other material like transparency.
