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.
Answer:
Makes it easier to read... summarize cite electronic versions of editions
Answer:
CDMA is sa station.
Explanation:
CDMA is basically a Code Division Multiple Access .It is assgned code that facilitates the signals or special coding scheme.It optimizes the use of bandwidth, It is used in a UHF and send data over entire bandwidth of channel.It send data without sharing of capacity of channel. Its ranges is between 800 MHz and 1.9 GHz
That if something happens such as some one gets cancer you can pay for it or if you lose your job you can still have time to react and get a new job
Answer:
Explanation:
An answer on Brainly can only be marked as Brainliest if the individual who answered the question is not yourself, and if one week has passed since the answer was posted. Once the week has passed and the answer is still there (has not been removed) then a Brainliest button should appear that will allow you to mark the answer as Brainliest. Simply click the button and the answer will be marked as Brainliest.
