adplus-dvertising
frame-decoration

Question

Which of the following statements is used in the binary search algorithm to halve the array ?

a.

middle Sub = middle Sub/2;

b.

middle Sub = (stop Sub - start Sub)/2;

c.

middle Sub = start Sub + stop Sub/2;

d.

middle Sub = (start Sub + stop Sub)/2;

Answer: (d).middle Sub = (start Sub + stop Sub)/2;

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following statements is used in the binary search algorithm to halve the array ?

Similar Questions

Discover Related MCQs

Q. The data for which you are searching is called

Q. If the binary search algorithm determines that the search argument is in the lower half of the array, which of the following statements will, set the appropriate variable to the appropriate value?

Q. Which of the following is false ?

Q. The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is

Q. The average successful search time taken by binary search on a sorted array of 10 items is

Q. The average successful search time for sequential search on 'n' items is

Q. Sorting is useful for

Q. Choose the correct statements

Q. A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be

Q. The way a card game player arranges his cards as he picks them up one by one, is an example of

Q. You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?

Q. The average number of comparisons performed by the merge sort algorithm, in merging two sorted liss of length 2 is

Q. Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficienty?

Q. You are asked to sort 15 randomly generated numbers. You should prefer

Q. As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be

Q. The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)

Q. Where is linear searching used?

Q. What is the best case for linear search?

Q. What is the worst case for linear search?

Q. What is the best case and worst case complexity of ordered linear search?