info@avatto.com
+91-9920808017
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
60
45
20
None of these
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
17. Which of the following sorting procedure is the slowest?
Quick sort
Shell sort
Bubble sort
18. Which of the following sorting method is stable?
Straight insertion sort
Binary insertion sort
Heap sort
19. Which of the following best describes sorting?
Accessing and processing each record exactly once
Finding the location of the record with a given key
Arranging the data (a record) in some given order
Adding a new record to the data structure
20. A sort which compares adjacent elements in a list and switches where necessary is
insertion sort
heap sort
quick sort
bubble sort
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
