Suppose you have the following sorted list [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] and are using the binary search algorithm. Which group of numbers correctly shows the sequence of comparisons used to find the key 8? If the array/subarray has even length, there is two choices for the middle elemer In this case, choose the left one, i.e., a, b, c, d, then middle element is b. O 11, 5, 6, 8 O 14, 12, 11, 8 O 12, 6, 5, 8 O 18, 12, 6, 8 O 3.5 6 8

Suppose you have the following sorted list [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] and are using the binary search algorithm. Which group of numbers correctly shows the sequence of comparisons used to find the key 8? If the array/subarray has even length, there is two choices for the middle elemer In this case, choose the left one, i.e., a, b, c, d, then middle element is b. O 11, 5, 6, 8 O 14, 12, 11, 8 O 12, 6, 5, 8 O 18, 12, 6, 8 O 3.5 6 8

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Use the following sorted array to answer the following questions: 1 3 4 7 8 10 11 1 2 3 5 7 11 13 17 19 23 29 31 What values (not index) are examined in what order when searching for 19 using binary search? For example, when it examines whether 1, 3, 5 and 19 are equal to 19, write down 1, 3, 5, 19.
Assume nums is an array of integers that looks like this: -3 12 9 0 2 -1 If we are sorting from smallest to largest, what will nums look like after 2 times through the outside loop if we are using bubble sort? Note: When you're entering the values, make sure you leave at least one space between them. Would it be possible to perform a linear search on a 2-D array? Answers: Yes, but you would be limited to using only one loop No, because a 2-D array is not stored in linear fashion in RAM Yes, as long as you used the proper nested loops No, you would have to use a binary search Yes, but only if the array's elements were sorted
You are given two arrays, one shorter (with all separate items) and one longer (with no unique elements). Find the shortest subarray in the larger array that contains all of the shorter array's items. The things can be shown in any order.EXAMPLEInput: {1, 5, 9}{7, 5, 9, 0, 2, 1, 3, 5. 7, 9. 1, 1, 5, 8, 8, 9, 7}Results: [7, 10] (the underlined portion above)
Let A be an array, where each of the n elements is a randomly chosen digit between 0 and 9. For example, if n = 12, this array could be A = [3,5,1,0,5,7,9,2,2,8,8,6]. Determine whether Counting Sort or Merge Sort sorts this array faster.
Use insertion sort to sort the following array (6, 2, 5,9,4, 2, 3, 7, 1, 8, 5}. Any observations here? Is insertion sort stable or not? Is insertion sort in-place or not?
AlgorithmThis algorithm is a two step process.First we create a auxiliary array lps[] and then use this array for searching thepattern.Preprocessing :1. We pre-process the pattern and create an auxiliary array lps[] which is used to skip characters whilematching.2. Here lps[] indicates longest proper prefix which is also suffix.A proper prefix is prefix in which whole string isnot included.For example, prefixes of string ABC are “ ”, “A”, “AB” and “ABC”. Proper prefixes are “ ”, “A” and“AB”. Suffixes of the string are “ ”, “C”, “BC” and “ABC”.Searching1. We keep matching characters txt[i] and pat[j] and keep incrementing i and j while pat[j] and txt[i] keepmatching.2. When we see a mismatch,we know that characters pat[0..j-1] match with txt[i-j+1…i-1].We also know thatlps[j-1] is count of characters of pat[0…j-1] that are both proper prefix and suffix.From this we can concludethat we do not need to match these lps[j-1] characters with txt[i-j…i-1] because we know that thesecharacters…
Given are the elements of an amay that needs to be sorted ascending order. Simulate each of the following amrays below using the different sorting algorithms: 1. Selection Sort 44 38 47 46 19 50 48 2. Insertion Sort 5 44 38 47 15 36 26 3. Quick Sort 2 29 19 35 16 17 18 26 48 11 4. 3.
Please work on a piece of paper. Use insertion sort to sort the following array {6, 2, 5,9, 4, 2, 3, 7, 1, 8, 5}. Any observations here? Is insertion sort stable or not? Is insertion sort in place or not?