choose the correct answer. What is the Big Theta runtime of this function, where n is the length of the list?def f(1st):i = 1while i < len(1st):j = i + 1while j / 2 > i:1st[j]j = j + 1i = i + 1i+j Theta(log n)Theta(n)Theta(n log n)Theta(n^2)This code does not terminate.This code does not have a tight Theta bound.

The code snippet given:- def f(lst): i = 1 while i < len(lst): j = i + 1…

Answered: What is the Big Theta runtime of this…

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

Please answer it in Python Write a function min_odd that takes a list as an argument and returns the smallest even integer contained in the list. If the list contains no even integers, the function will return None. For Example : min_odd([45, 62, 19, 22, 26, 18, 3, 5, 14])Expected answer is 14 min_odd([])Expected answer is None Write a function index_of that takes as an argument an integer (supposedly even) and a list, and returns the index to which this integer appears in the list. If the integer does not appear, the function will return None. It is assumed here for simplicity that the integer searched for does not appear several times in the list. Hint: if the for e in list loop doesn't suit you, remember that you can make a for + range or a while. .. For Example: index_of(34, [3, 67, 62, 34, 19, 24])Expected answer is 3 index_of(16, [2, 6, 104, 5, 25, 18, 50, 16])Expected answer is 7
5. The following function indexCounter aims to find and return all the indices of the element x in a list L. if x is not in the list L, return an empty list. However, the implementation has a flaw, so that many times it will return error message. Can you fix the flaw? def indexCounter(L, x): indexList [] startIndex = 0 while startIndex < len(L): indexList.append (L.index (x, startIndex)) startIndex = L.index (x, startIndex) + 1 return indexList
Write a function that accepts two lists as it's only arguments. The function should return a new list containing all the elements of the two list arguments. For example, if the function was passed the lists [1, 2, 3] and [4, 5, 6], it would return a new list containing [1, 2, 3, 4, 5, 6]
1.Given the argument passed to the function is a list containing integer values, what does the function return def mystery1(someListOfValues: list):total = 0for value in someListOfValues:total += valuereturn total/len(someListOfValues) 2. The function below is to find the largest value in a list passed by parameter. Does it work as intened (yes or no)? If not give an example of an argument it would not work for. def maxValue(someListOfValues:list):"""returns the largest value the list passed by parameter"""value = 0for num in someListOfValues:if num > value:value = numreturn value 3.Write a function called loadNames() that will open a file called names.txt and build a list of its contents and return it. Function Call: names = loadNames()print(names) Sample ouput: ['Nolan Rafaj\n', 'Brandon Brzuszkiewicz\n', 'Amanda Vozari\n', 'Chase Harper\n', 'Bryce Conner']
Write a function oddfirst : int list -> int list = that takes a int list and returns the same list, but where all odd numbers come before the even numbers. 1 # oddfirst [4;2;7;3;1;0; 9;3;6;-1;0;3];; : int list - 2 - [7; 3; 1; 9; 3; -1; 3; 4; 2; 0; 6; 0] 3 # oddfirst [1;0;0;4;6;1; 2;100; -7;4; -9]; ; int list = [1; 1; -7; -9; 0; 0; 4; 6; 2; 100; 4]
Define the function (siftNum lst). This function should resolve to all the numbers in the list, lst. For example: (siftNum '(a 8 2 1 m l 90 p 2)) resolves to '(8 2 1 1 90 2).
Please answer it in Python Write a function insere_milieu that takes as an argument a list l and an element elem and returns the list obtained from l by adding elem "in the middle" of l, that is: If the length of l is even, the item is added once, in the middle of the list. If the length of l is odd: the element is added on either side of the central element. Example: insere_milieu([4, 7, 12, 3], 0) is [4, 7, 0, 12,3] insere_milieu([9, 3, 5, 6, 2], 1) is [9, 3, 1, 5, 1, 6, 2].
emacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.
PLZ write in SML language. Thank you Write a function maxGroup that determines, for a given integer list, the stored number of the longest consecutive group of equal numbers. For example, maxGroup [2, 9, 8, 8, 8, 7, 9, 1] should return 8 since there are three consecutive 8s in the list. Hint: Solve the problem in two steps. First, determine the length of each group of equal numbers. Then, determine which is the largest.
2. listAverage() returns the average number in a list. Which of these functions does this correctly? O A. function listAverage (1ist) ( var sum - for ( var 8 0: 0< list length sum- sum + 1ist A return sum / ist.length O B. tunction listAverage (list){ var sum for( var 8 0: Ise. 1ength sum sum + Ist O return sum / 1ist length . function listAverage (list) ( var sum= return sum / HElength) for ( var 0 0
CLO3: Analyze the given function below that takes a binary list of size (n) and returns the number of 1's, O's and sum of 1's in the list. Answer the questions below: def function(List): zeroCount = 0 oneCount = 0 onesSum=0 for i in range(len(List)): if Listfi) - 0: zeroCount +=1 else: oneCount += 1 onesSum += 1 print ('Number of Zeros =', zeroCount) print ('Number of Ones =, oneCount) print ('Sum of Ones =', onesSum) 1. Count the number of steps required by the function in terms of n? (" 2. What is the time complexity of the algorithm. (1. 3. Find number of operations if (n = 20).
Write a function getOdds() that takes a list of integer numbers as parameter, returns a new list made of only the odd numbers in the list.Example: If the parameter list contains [44, 81, 7, 24], the function will return [81, 7].

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

What is the Big Theta runtime of this function, where n is the length of the list? def f(1st): i = 1 while i < len(1st): j = i + 1 while j / 2 > i: 1st[j] j = j + 1 i i+j %3D i + 1 %3D