Question: 18. Choose the best answer that is true about Bubble Sort: A. It takes N log2 N comparisons and works by exchanging the top item
18. Choose the best answer that is true about Bubble Sort: A. It takes N log2 N comparisons and works by exchanging the top item with the smallest item B. It takes N log2 N comparisons and works by exchanging adjacent items if the first one is larger C. It takes N2 comparisons and works by exchanging the top item with the smallest item D. It takes N2 comparisons and works by exchanging adjacent items if the first one is larger 19. A binary search on a sorted array of 1000 items will require at most how many comparisons to find the correct element or report failure? A. 8 B. 10 C. 12 D 16 E 100 20. A binary search of an array begins by examining which clement of the array? A. The largest element B. The first element C. The last clement D The middle clement E. None of these
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
