10. Consider the following program, implementing binary search to look for a word in a list of words: Here we're looking for the string target, in the list list of words. def search_binary(list of_words, target, debug_print-False): "** Find and return an index of target in list_of_words # 1 and r represent the region of interest that we search over. # initially this is the whole of xs 1 - 0 r = len(list_of_words) while 1 < r: m = (1 + r)// 2 # The mid point of the interval if debug_print: print("Interval [{0}:{1}](size-{2}), probed=D'{3}', target-(4}" .format (1, r, r-1, list_of_words[m], target)) if target < list_of_words[m][0]: r = m elif target > list_of_words[m][0]: 1 - m+1 else: assert target == list_of_words[m][0] return list_of_words[m][1] return What has to be true about list of words in order for this function to find the index of the target word? You m to look at Lecture 17 for reference if this seems mysterious, Is this search function fast? Can you explain why

10. Consider the following program, implementing binary search to look for a word in a list of words: Here we're looking for the string target, in the list list of words. def search_binary(list of_words, target, debug_print-False): "** Find and return an index of target in list_of_words # 1 and r represent the region of interest that we search over. # initially this is the whole of xs 1 - 0 r = len(list_of_words) while 1 < r: m = (1 + r)// 2 # The mid point of the interval if debug_print: print("Interval [{0}:{1}](size-{2}), probed=D'{3}', target-(4}" .format (1, r, r-1, list_of_words[m], target)) if target < list_of_words[m][0]: r = m elif target > list_of_words[m][0]: 1 - m+1 else: assert target == list_of_words[m][0] return list_of_words[m][1] return What has to be true about list of words in order for this function to find the index of the target word? You m to look at Lecture 17 for reference if this seems mysterious, Is this search function fast? Can you explain why

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: program Here we're looking for the string target, in the list list_of_words. def…

A: Binary search works on the principle of divide and conquer. It looks for search item by comparing…

Q: This is to be done in ML coding language. Please provide the actual code (with an output). Try and…

A: The ML Code is given below with output screenshot

Q: Write a function that accepts a variable number of string parameters. The function must use list…

A: Answer in step2

Q: Implement a program that implements a sorted list using dynamic allocated arrays. Use C++ and do…

A: A sorted list using dynamic allocated arrays is a data structure that allows you to store elements…

Q: Create your own code • Think of a simple algorithm for sorting a list in ascending order. •…

A: According to the information given:- We have to create and algorithm to sorting a list in ascending…

Q: python code Write a recursive function such that, given a list of integers (say v) and an integer…

A: 1. find_subset(v, x)Input: A list of integers v and an integer x.Output: A subset of integers from v…

Q: Java: Write a program to find the number of comparison using sequentialSearch and binarySearch…

A: The Complete code is give below.

Q: Define a function sorted_intersection which • accepts two sequences, and • return a list whose…

A: Here is the python code: See below steps for code.

Q: A a. A Pythagorean triple is a list [a, b, c] of positive integers a < b <c so that a + b? = c2.…

A: Python used to answer this question

Q: python help Implement function indexes() that takes as input a word (as a string) and a…

A: I give the code in Python along with the output and code screenshot

Q: REQUIREMENTS: 1. 2. 3. Using Python, you will write a program called singly-linked-list-arrays.py…

A: Algorithm:- The algorithm is defined as a set of steps to perform a specific task.

Q: Suppose lists A and B are lists with same length and have only integer items. define the function…

Q: an array of 1200 elements. Use a random number generator to fill list by using a sorting algorithm…

A: import java.util.*;public class Main { public static void main(String[] args) { int[] list=new…

Q: /** *Return the first index of element in the list. If element * is null or not found in the list,…

A: Here is the approach : Create the class and have some class properties like the list and the…

Q: Write a function abs_nums (numbers) that takes a list of numbers as a parameter and returns a list…

A: 1. Declare function abs_nums with parameter nums a. run loop from 0 to length of list i.…

Q: This is to be done in ML programming language. Please use the simplest code possible, nothing too…

A: A couple of supporting functions are written to maintain the order of elements after removal. 1.…

Q: Function Description Generate the code for a recursive function: furthest(n: int, lst: list)--> int…

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

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

10. Consider the following program, implementing binary search to look for a word in a list of words:
Here we're looking for the string target, in the list list_of_words.
def search_binary(list_of_words, target, debug_print-False):
"*" Find and return an index of target in list_of_words
# 1 and r represent the region of interest that we search over.
# initially this is the whole of xs
1- 0
r = len(list_of_words)
while 1 < r:
m = (1 + r) // 2 # The mid point of the interval
if debug_print:
print("Interval[{0}:{1}](size={2}), probed='{3}', target="{4}"
- format(1, r, r-1, list_of_words[m], target))
if target < list_of_words[m][0]:
elif target > list_of_words[m][0]:
1 - m+1
else:
assert target ==
list of_words[m][@]
return list_of_words[m][1]
return
-1
What has to be true about list of_words in order for this function to find the index of the target word? You might want
to look at Lecture 17 for reference if this seems mysterious. Is this search function fast? Can you explain why?

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

VIEW

Step 2

VIEW

Step 3

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

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
Using c++ Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…
Python data structures: write a function that takes in a list (L) as input, and returns the number of inversions. An inversion in L is a pair of elements x and y such that x appears before y in L, but x > y. Your function must run in -place and implement the best possible algoritm of time complexity. def inversions(L: List) -> int:'''finds and returns number of inversions'''
in java pls and thank you!