Data Structures and Algorithms - Sorting and Searching

16. Suppose DATA array contains 1000000 elements. Using the binary search algorithm, one requires only about n comparisons to find the location of an item in the DATA array, then n is

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


17. Which of the following sorting procedure is the slowest?

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


18. Which of the following sorting method is stable?

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


19. Which of the following best describes sorting?

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


20. A sort which compares adjacent elements in a list and switches where necessary is

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.