Consider the following list:5, 12, 25, 32, 38, 46, 58, 62, 85, 90, 97, 105, 110Using the binary search, how many comparisons are required to determine whether the following items are in the list or not? Show the values of first, last, and middle and the number of comparisons after each iteration of the loop. a. 32 b. 20 c. 105 d. 60

Consider the following list:5, 12, 25, 32, 38, 46, 58, 62, 85, 90, 97, 105, 110Using the binary search, how many comparisons are required to determine whether the following items are in the list or not? Show the values of first, last, and middle and the number of comparisons after each iteration of the loop. a. 32 b. 20 c. 105 d. 60

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Consider the following list:6, 25, 32, 39, 65, 77, 88, 99, 110, 124, 130Using the binary search, how many comparisons are required to determine whether the following items are in the list or not? a. 5 b. 25 c. 30 d. 65 e. 77 f. 110 g. 134
Assume the following list of keys: 16, 38, 54, 80, 22, 65, 55, 48, 64, 95, 5,100, 58, 25, 36 This list is to be sorted using quicksort as discussed in this chapter. Use pivot as the middle element of the list. a.) Give the resulting list after one call to the partition b.) Give the resulting list after two calls to the partition
Should one choose sequential search over binary? I'm curious about the benefits and drawbacks.
A list is given an = {6,2,-4,13,7} Answer the following questions. a. What is n in an? b. List all the steps of sorting this list using insertion sort. c. What is the output of this search? And what does it indicate?
A list of n dates of birth (specified in the format 17801229) should be sorted. Assume that n is a large number (> 400) and that there may be duplicates. Which of the following algorithms is most suitable to choose? Countingsort Heapsort Mergesort Quicksort Insertionsort Radixsort
the list has the following items 17 9 11 30 8 20 35 7 5 45 3 28 Apply the quick sort on the above list by using the pivot is always the left item and find the following The list after a first partition call
Which of the following algorithms finds the average of the largest and smallest integers in a list of n integers (n ≥ 1)? Initialize variables max and min to the first element of the list. Iterate over the list and update max and min as necessary. Return the average of max and min. Sort the list in non-decreasing order. Return the average of the first and last elements of the sorted list. Create a new list consisting of the largest and smallest integers in the original list. Return the average of the two elements in the new list. Initialize variables max and min to 0 and infinity, respectively. Iterate over the list and update max and min as necessary. Return the average of max and min.
Given the unsorted list [6, 5, 4, 3, 7, 1, 2], show what the contents of the listwould be after each iteration of the loop as it is sorted using the following:a. Selection sortb. Insertion sort
Computer Science Trace the following sorting algorithms for the next list. 025, 001, 585, 162, 382, 500, 200, 367, 333, 568, 529 Insertion sort Bubble sort Shellsort Radix sort Merge sort Quicksort
The bubble sort algorithm is used to sort the following sequence of integers: 3 32 19 41 27 20 7 •How many passes must the algorithm perform to guarantee the entire sequence is sorted?•What is the list obtained after the first pass?•What is the list obtained after the third pass?•What is the list obtained after the final pass? Please break this down in steps. Thank you!
Starter Code: def find_zero(L): pass def bubble(L, left, right): pass def selection(L, left, right): pass def insertion(L, left, right): pass def sort_halfsorted(L, sort): '''Efficiently sorts a list comprising a series of negative items, a single 0, and a series of positive items Input ----- * L:list a half sorted list, e.g. [-2, -1, -3, 0, 4, 3, 7, 9, 14] <---neg---> <----pos-----> * sort: func(L:list, left:int, right:int) a function that sorts the sublist L[left:right] in-place note that we use python convention here: L[left:right] includes left but not right Output ------ * None this algorithm sorts `L` in-place, so it does not need a return statement Examples -------- >>> L = [-1, -2, -3, 0, 3, 2, 1] >>> sort_halfsorted(L, bubble) >>> print(L) [-3, -2, -1, 0, 1, 2, 3] ''' idx_zero = find_zero(L) # find the 0 index sort(L, 0, idx_zero) # sort left half sort(L, idx_zero+1, len(L)) # sort right half
Assume the following list of 16 keys:18, 40, 16, 82, 64, 67, 57, 50, 37, 47, 72, 14, 17, 27, 35, 20 This list is to be sorted using Merge Sort, the number of recursive levels required to finish dividing steps this list is: 4 8 16 3