What is the complexity of the following Python code snippet in Big- O notation? Assume is a list of n unsorted numbers;data 2 is a list of n sorted numbers. def binary_search(data, value): n = len(data) left = 0 right = n - 1 while left <= right: middle = (left + right) // 2 if value < data[middle]: right = middle - 1 elif value > data[middle]: left = middle + 1 else: return middle return 'Value is not in the list'

What is the complexity of the following Python code snippet in Big- O notation? Assume is a list of n unsorted numbers;data 2 is a list of n sorted numbers. def binary_search(data, value): n = len(data) left = 0 right = n - 1 while left <= right: middle = (left + right) // 2 if value < data[middle]: right = middle - 1 elif value > data[middle]: left = middle + 1 else: return middle return 'Value is not in the list'

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

1.2 What is the complexity of the following Python code snippet in Big- O notation? Assume the input is a list of n sorted numbers. def binary_search(data, value): n = len(data) left = 0 right = n - 1 while left <= right: middle = (left + right) // 2 if value < data[middle]: right = middle - 1 elif value > data[middle]: left = middle + 1 else: return middle return 'Value is not in the list'print(binary_search(data, 2021))
python code. Instructions are written within the quotations for function. 1)def fun_b(t, d): """ t is a list of tuples (item_name, quantity) that is a shopping list of items you would like to buy. d is a dictionary mapping item_name to its unit price. Calculate the total cost of the shopping list. For items that is not in d, set the default price to be 2.89 """ return 0 2) def run(): d = {"banana": 1.0, "orange":2.0, "toilet paper":3.0, "chips":4.0, "steak":10.0} t = [("banana", 2), ("steak", 1), ("toilet paper", 3), ("orange", 2.5), ("banana", 3)] print(f"{fun_b(t,d)}") if __name__ == "__main__": run()
(IN C++) Write a program to implement Quicksort. Also implement one of the slow sorts (Bubble, Insertion...). After you have tested both, generate a very large array (30,000 or more) of bytes and sort increasingly larger portions of the array (5000, 10000, ..., 30000) with both algorithms. Draw a graph of execution time versus number of elements for both algorithms. What are your conclusions? (IN C++) please.
In python Code so far: # TODO: Declare global variables here.recursions = 0comparisons = 0 def binary_search(nums, target, lower, upper): # Type your code here. target = (lower + upper) //2 global if target == nums[index]: return index if (lower == upper): comparisons +=1 if target == nums[lower]: return lower else: return -1 if (nums[index] < target): recursions += 1 return binary_search(nums,target, index, upper) if nums[index] > target: recursions += 1 return binary_search(nums, target, 0, lower) if __name__ == '__main__': # Input a list of nums from the first line of input nums = [int(n) for n in input().split()] # Input a target value target = int(input()) # Start off with default values: full range of list indices index = binary_search(nums, target, 0, len(nums) - 1) # Output the index where target was found in nums, and the # number of…
1. Write a C program that will initially create a SORTED list containing the following and then run the program:DianeJackKatherineMitchRobbie Answer and explain the following questions below:a) If we check the memory location of each element in the list, what would it be? What index represent each element?b) What happens if we add Morrie in the list? What will be its index value? c) What does the new list looks like? Where do you think Morrie should be placed and why? With the same list above (with Morrie added), delete/remove Jack. Answer and explain the following questions below:a) What is the new list? Identify the elements of the list and its index.b) What happened to the former location occupied by Jack?
In C# Suppose variable nums contains a list of integers.List«Integer> nums = Arrays.asList(1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1);var nums = new List«int> { 1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1 }Using Java Stream API *or* LINQ, write a short code that prints the following.For each section indicate the platform (whether the solution is given in Java orC# LINQ).A) Print all numbers.B) Print the sum() of the numbers.C) count how many times number '1' appears in the list.
code needed for python 3: You are required to investigate the number of comparisons that take place during the execution of an insertion sort. Given a list of ?N unsorted integers, use insertion sort to count the number of comparisons that it takes to arrive at the sorted list. Your insertion sort should execute from left to right. Function specifications Argument(s): integers (list) →→ a list of unsorted integers. Return: comparisons (int) →→ return the number of comparisons made to arrive at the sorted list. ### START FUNCTIONdef insertion_sort(integers): ### END FUNCTION integers = [15, 1, 2, 16, 12, 16, 9, 2, 0, 11]insertion_sort(integers.copy()) Expected output integers = [15, 1, 2, 16, 12, 16, 9, 2, 0, 11] insertion_sort(integers) == 25
def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. ''' pass
Using Dr-Racket, what is the purpose of the number function?(define (number n)(local [(define (abstract int)(* int 11))] (build-list n abstract))) A) Create a list of the first n multiples of 11 starting at 11. B) Create a list of the first n multiples of 11 starting at 0. C) Create a list of the first n multiples of 11 starting at 1. D) Create a list of the first 11 multiples of n starting at 1. E) Create a list of the first 11 multiples of n starting at 0.F) Create a list of the first 11 multiples of n starting at n.
Please code this in Java Or C or C++ Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
Hi Im new to Python and need to generate a script in Python : i have an array of arr= [1,2,3,4] , this can be any number of values, or I can also have an array with strings. e.g: arr= ['a','b','c','d'] I need to output this: [(1),(2,3,4)] [(2),(1,3,4)] [(3),(1,2,4)] [(4),(1,2,3)] [(1,2),(3,4)] [(1,3),(2,4)] [(1,4),(2,3)]
2. For the code below, draw a picture of the program stack when the function partition() is called the 2nd time. # extracted from suquant's reply at # https://stackoverflow.com/questions/18262306/quicksort-with-python def partition(array, begin, end): pivot = begin for i in range(begin+1, end+1): if array[i] <= array[begin]: pivot += 1 array[i], array[pivot] = array[pivot], array[i] array[pivot], array[begin] = array[begin], array[pivot] return pivot def quicksort(array, begin, end): if begin >= end: return pivot = partition(array, begin, end) quicksort(array, begin, pivot-1) quicksort(array, pivot+1, end) # added calling code if __name__ == "__main__": mylist = [8, 2, 17, 4, 12] quicksort(mylist, 0, 4)