Answer:
are u updating it? or u r rooting it?
Answer:
zero ( 0) times.
Explanation:
In the code;
i = 2
while ( i > 2){
i = floor( i/2 );
z = z + 1;
}
the variable " i " is assigned the integer " 2 ", then the while statement loops with a condition of a greater " i " value and divides the value by two for every loop.
But in this case, the while statement is not executed as the value of " i " which is 2 is not greater than but equal to two.
Answer:
A linear search is one that scans every record/file until it discovers the value being searched for.
Binary search, on the other hand, is also known as <em>Logarithmic search</em>. It is used to locate the position of a value inside an array that has already been sorted.
The linear search will return the lowest value faster than the binary search when small arrays are involved.
This will only be feasible when the array is sorted prior.
Cheers!
