Answer:
Following are attached images that will help you understand the complete code. The code is tested with different variables and different outputs are obtained. All the necessary description is given in the form o comments inside the code.
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.
TRUE
Psychodynamic theories are usually too vague to allow a
clear scientific test. Modest support for central psychodynamic hypotheses has
been provided by Empirical studies. Critics have in the past disputed very many
aspects of psychoanalysis including whether it is indeed a science or not.
However much this is so, psychoanalysis is a great idea in personality that
should never be overlooked.
Sadly this statement is true
The answer is B. False.
HOPE THIS HELPS!!!
