Data Structures and Algorithms - Sorting and Searching

21. A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


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

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


23. The data for which you are searching is called

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


24. 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?

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.