What is the time complexity of the following function? def mystery(lst): index = 0 while index < 1000: index2 = 0 while index2 < index ** 2: index2 = index2 + 1 index = index + 1 a) Linear b) Quadratic c) Slower than quadratic d) Faster than linear

What is the time complexity of the following function? def mystery(lst): index = 0 while index < 1000: index2 = 0 while index2 < index ** 2: index2 = index2 + 1 index = index + 1 a) Linear b) Quadratic c) Slower than quadratic d) Faster than linear

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 12PE

See similar textbooks

Similar questions

Python Question What is the time complexity of the following function? def mystery(lst): index = 0 while index < len(lst): index2 = 0 while index2 < index: index2 = index2 + 1 index = index + 1 a) Linearb) Quadraticc) Slower than quadraticd) Faster than linear
PYTHON HELP
function [P, A] = rect(L, W) P= 2 (L+ W); A =L*W; end Above function is defined to find perimeter and area of a rectangle. If a rectangle has length 10 mm and width 7 mm then the correct way to get perimeter and area of a given rectangle by executing this function is Select one: a. [A, B] = rect(10, 7) b. rect(7, 10) c. [A, B] = rect(7, 10) d. rect(10, 7)
Exercise B: "Matrix Addition" For this exercise you will design and implement a function that takes two matrix arguments and computes their sum (if and only if a sum can actually be computed, returning an empty list otherwise). Two matrices can only be added together if they have exactly the same dimensions. If the dimensions are acceptable, then the matrix sum will have the same dimensions as either of the operands, and the value of each element in the matrix sum is itself the sum of the corresponding elements in the operand matrices. And although it does makes sense to test rectangularity before attempting addition, you need not perform this step (since you did it above). In order to complete this task, you will need to: ensure you know how matrix addition can be performed² ● Your submission for this exercise:
Python Q What is the time complexity of the following function? def mystery(lst): index = 0 while index < 1000: index2 = 0 while index2 < index ** 2: index2 = index2 + 1 index = index + 1 a) Linearb) Quadraticc) Slower than quadraticd) Faster than linear
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
Python question Analysis: Computational Complexity (Q14-15) In this section, you are asked to analyse the worst-case computational time complexity of Python functions. Always identify the order of growth in the tightest and simplest possible form using big-O notation, e.g., write O(n) instead of O(2n+n/2). Question 14 (Complexity 1) State the overall worst-case time complexity of the below function and provide a short explanation of your answer. The function accepts an integer n as input. def mystery(n): num = 1 count = 0 while num < n: num = num*2 count += 1 return count Question 15 (Complexity 2) State the overall worst-case time complexity of the below function and provide a short explanation of your answer. The function is supposed to return a list, res, containing the duplicated elements in the given list , lst, of size n. Analyse the function in terms of the length of the list, n. def duplicate_values(lst): res = [] for i in range(len(lst)):…
(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
Question 1.wfi
Write a function verifsort that accepts a list as a parameter, check if the list elements are sorted and returns: 1 - if the list is sorted in ascending order, 2 – if the list is sorted in descending order, and 0 – if the list is not sorted. Write a function listsort which accepts a list as a parameter, and sorts it in ascending order. You can use any standard sorting algorithm, but don’t use built-in sort methods and functions. The function must sort and return the list. Write a script that asks user to enter 10 integer numbers, creates a list from those numbers, then calls verifsort function to detect if this list is sorted, prints message (list is sorted or list is not sorted) and if it’s not sorted then calls listsort function and prints the sorted list after listsort
Question: First write a function mulByDigit :: Int -> BigInt -> BigInt which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1] Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] [] Your implementation should not be recursive. Code: import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…
Please answer it in Python Write a function last_consonant that takes as an argument a word and returns two return values: the index of its last consonant as well as the last consonant (as for lists, we will consider that the index of the first letter is zero). We will not deal with the problematic case where the word does not contain a consonant. Example: last_consonant('arrivee') returns 4, 'v' Write a function double_consonant that takes as an argument a word and has two return values: a Boolean worth True if the word contains a double consonant (twice the same consonant in a row), and in this case the second return value is the consonant that is doubled; If there is no doubled consonant, the function must return False and None. If the word contains several double consonants (for example, 'successor'), true will be returned and the first double consonant appearing in the word. Examples: double_consonant('arrive') is true, 'r'. double_consonant ('candy') is false, None…