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:
Never heard of that kind of software, but I think it's an old file.
Answer:
def isdivisible():
maxint=input("Enter the Max Int")
int1=0
int2=0
int1=input("Enter the first Integer")
int2=input("Enter the second Integer")
tup1=(int1, int2)
print(tup1)
i = 1
for i in range(1, int(maxint)-1):
if int(tup1[0])%i==0 & int(tup1[1])%i==0:
print(i)
else:
continue
isdivisible()
1.2 Outputs
First test case:
Enter the Max Int6
Enter the first Integer2
Enter the second Integer8
('2', '8')
1
2
Second test case: returning empty list
Enter the Max Int2
Enter the first Integer13
Enter the second Integer27
('13', '27')
Test case 3:
Enter the Max Int4
Enter the first Integer8
Enter the second Integer10
('8', '10')
1
2
Explanation:
The program is as above, and the three test cases are also mentioned. We have created a tuple out of two input integer, and performed the output as required.
Answer:
V-chip technology works much like closed captioning and uses the vertical blanking interval in the television signal.
