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:
Explanation:
I have written the code in Java. It contains the class Insertion Sorter which has the InsertionSort function. This function uses the insertion sort algorithm to sort a comparable array and if it fails to do so for whatever reason it throws an Illegal ArgumentException. If it sorts the array correctly it returns the number of changes that needed to be made in order to correctly sort the array. Due to technical difficulties I have attached the code as a text document below and proof of output in the picture below as well.
Answer:
C: disruptive technology era
Explanation:
There are five main stages in IT infrastructure era and the are, in order from the oldest to the newest; the mainframe and minicomputer era, the personal computer era, the client/server era, the enterprise era, and the cloud computing being the newest in the five stages eras of IT infrastructure.
Answer:
Go to Settings. Click on Advanced Settings. Scroll down to the Accessibility section. Make sure that the box next to “Automatically click when the mouse pointer stops” is Unchecked.
Explanation:
here you go hope this helps!!
