Given the list [45,77,89,90,94,99,100]. What are the middle values (a[m]) in the first and second splits when searching for 89? from math import floor def BinarySearch(a, t): L = 0 R = len(a) -1 while L <= R: m floor((LR) / 2) if a[m] t: R=m-1 else: return m return -1 89 and 77 90 and 77 90 and 89 77 and 99

Given the list [45,77,89,90,94,99,100]. What are the middle values (a[m]) in the first and second splits when searching for 89? from math import floor def BinarySearch(a, t): L = 0 R = len(a) -1 while L <= R: m floor((LR) / 2) if a[m] t: R=m-1 else: return m return -1 89 and 77 90 and 77 90 and 89 77 and 99

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

Related questions

Q: Given the following function, what happens if a[] contains just one element that doesn't match val?…

A: Dear Student, The answer to your question is given below -

Q: from typing import List def count_odds(values: List[List[int]]) -> List[int]: "" "Return a list of…

A: I give the code in Python as per your requirement along with output and code screenshot

Q: The array contains all 10 different integers. Store them in a linked list in order and print them…

A: C++: C++ is a general purpose high level programming language. It is an extension of C language. It…

Q: Python help Write a program that reads a list of ten integers, the user enters the list elements…

A: Refer to step 2 for the answer.

Q: Problem Write a function named count_letters that counts the letters in its parameter named s. It…

A: Required: Required code with comments for explanation and screenshot of both code and output has…

Q: Assume double[][] x = new double[3][2], what are x[0].length and x.length?

A: In this question we have to understand what will be the length of these variables Let's understand…

Q: /** * Finds array t as a subsequence of arr and returns a list of the indices where * each element…

A: Initialize an empty list indices to store the indices where elements of t were found in…

Q: 1. Take an integer as input: this is the total count of items to store in the list. 2. Loop for…

A: It can be easily implemented using Python. Kindly check the well defined code with comments and…

Q: • count_words(sentence): returns a dictionary with all the words in sentence in lower case as keys,…

A: The task is to perform is that returns a dictionary with all words in a sentence in lower case as…

Q: def myfun ( x: Int, if x 0)': string) : String - { y + x, toString } else { myfun( x - 2 , "world" )…

A: Here we write answer of all the 6 Question marks:…

Q: What does the following code do? (where f1,f2,...,fn are functions; n is a integer number)

A: Dear Student, The answer of your question is given below -

Q: Write the function most common substring(S,m) that receives a string S and an integer m and returns…

A: The problem at hand is to find the most frequent substring of length m in a given string S. The…

Q: Simulation parameters: •Define a step size h. Try something small like 0.001 seconds. Define a…

A: You have presumably gone over the mean previously; it is the most usually utilized kind of normal…

Q: # Create a list of tuples tuples = [("p", 1), ("q", 2), ("r", 3)] # Use enumerate() to iterate over…

A: I have provided PYTHON CODE along with CODE SCREENSHOT and OUTPUT…

Q: def zara (L): '' 'list of str-> int Precondition: len (L)> 0 Returns the number…

A: The idea is simple, we consider each prefix and search it in the dictionary. If the prefix is…

Q: Single number (use XOR):

A: One can easily solve this question using the naive algorithm. But the solution for O(1) extra memory…

Q: An element that comprises more than half of the items in an array is referred to as a majority…

A: Let's begin with an illustration: 3 1 7 1 3 7 3 7 1 7 7 The majority element must appear much more…

Q: Need help with standard ML languege I need to write a binarySearch function that recursively…

A: write a binarySearch function that recursively implements the binary search algorithm to search a…

Q: works for the selection sort. I need a function that would work using the same logic for the…

A: solution in below step

Concept explainers

Merge sort

Merge Sort recursively sorts a given collection of numbers or elements by using the divide and conquer strategy in less time. It is one of the most used algorithms, with the worst-case time complexity of O (n log n). It was invented by John Von Neumann. The algorithm continuously divides an array into sub-arrays until each sub-array consists of a single element. It then merges those sub-arrays to produce a sorted array.

Question

Given the list [45,77,89,90,94,99,100]. What are the middle values (a[m]) in the first
and second splits when searching for 89?
from math import floor
def BinarySearch(a, t):
L = 0
R len(a) 1
while <R:
m = floor((L + R) / 2)
if a[m] <t:
Lm+1
elif a[m] >t:
else:
Rm 1
return m
return -1
89 and 77
90 and 77
90 and 89
77 and 99

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: The binary search algorithm :

VIEW

Step 2: The first two iteration explanation and the options :

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Python
This is for Python version 3.8.5 and please include pseudocode. nums = [8, 15, 6, 17, 33, 20, 14, 9, 12]Write Python code that: uses a function to print the size of the list named nums uses a function to print the largest number in nums prints the element 14 by using its index makes a slice named subnums containing only 33, 20, and 14
void func(vector<string>& names){ sort(names.begin(), names.end()); //(a) for(int i = names.size() - 1; i > 0; --i){. //(b) if(names[i] == names[i - 1]){ names[i] = move(names.back()); names.pop_back(); } } } What are the reasons or consequences for the programmer’s choice to loop backwards in the line marked (b), and under what circumstances would the algorithm behave differently if that line were replaced with: for (int i = 1; i < names.size(); ++i) ? What would change?
Python code Python Write a function named `freq(l)` that takes a list `l` of numbers and returns a tuple of the most frequent number and its frequency. For example, `freq([1,2,3,4,5,2,3,4,5,3,4,5,4,5,4]) returns (4,5) because number 4 appears 5 times in this list. If multiple numbers appear as most frequent, then the first element of the returned tuple is a list of all those numbers. For example, freq([1,2,3,1,2,1,2,3,1,2]) will return ([1,2], 4) because both 1 and 2 appear 4 times in the list. """ def freq(l): # remove the following line to solve this question return