PythonBig-O Time Complexity Part 1.2: Big bOx FunctionsYou are given two functions which are used in sequence as shown below.Nameless FunctionFirst blackbox functionInputBogosortOutput(List extender)The first blackbox function takes in as an input a list of integers. This list has a length of n and has at leasttwo unique integers. It then outputs n copies of that list as a single list.E.g. If the input is [1,2,7], the output is [1,2,7,1,2,7,1,2,7]. If the input is [1,2,3,4] the output is[1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4]. Design a function that performs this action. Can it be done in less than O(n)time?

Using python programming language we can do the task. first make a list of your input numbers. let…

E.g. If the input is [1,2,7], the output is [1,2,7,1,2,7,1,2,7]. If the input is [1,2,3,4] the output is [1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4]. Design a function that performs this action. Can it be done in less than O(n) time?

E.g. If the input is [1,2,7], the output is [1,2,7,1,2,7,1,2,7]. If the input is [1,2,3,4] the output is [1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4]. Design a function that performs this action. Can it be done in less than O(n) time?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Similar questions

Please answer in Python 1) Write a function towards which takes as an argument a list li (attention, not a word, unlike the other functions of this exercise) and which returns a list obtained from li by reversing the order of the elements. Example: towards(['a', 'b', 'c', 'd']) is ['d', 'c', 'b', 'a'] 2) Write a palindrome function that takes a word as an argument and returns a Boolean indicating whether the word is a palindrome. A palindrome is a word that remains the same when read from right to left instead of the usual order from left to right. Example: palindrome('here') is True but palindrome('go') is False.
The function list_combination takes two lists as arguments, list_one and list_two. Return from the function the combination of both lists - that is, a single list such that it alternately takes elements from both lists starting from list_one. You can assume that both list_one and list_two will be of equal lengths. As an example if list_one = [1,3,5] and if list_two = [2,4,6]. The function must return [1,2,3,4,5,6].
a- Write a Python function Salary_levels, that takes a list as an argument and returns the number of the high salaries (salary>=5000), the average salaries(1000<=salary<5000, and the low salaries (salary<1000). You can use the following list : salaries= [500,1070,1450,6500,9000,940,450,400,600,2750,1100,8400,1500,900,1200] b- Use the above function to print the counts of the high, average, and low salaries. N.B: the codes of parts a and b should be included in your answer.
Questions P1 and P2 are related to the following code segment. Below is the skeleton of a function that takes a list of integers as an argument and returns True if the sequence [2, 3, 4] appears somewhere in the list. Fill in the blanks (denoted by [P1] and [P2]) with values that make the function operate correctly. def f1(n): for i in range(0,_______[P1]_______): if [1,2,3] == _______[P2]_______: return True return False The value of [P1] is
Define a function called list_split_and_reverse(a_list) that takes a list as input. If the list is empty, print "List is empty, fail!" and return nothing. If the list has an odd number of elements print "List has odd number of elements, fail!" and return nothing. Otherwise split the list into two entirely new lists, one containing the first half of the elements, and the other containing the other half. Reverse the back-half/second list >>> a_list = [0, 2, 3, 7, 10, 20]>>> result = list_split_and_reverse([])Output: List is empty, fail! # result is also empty/None>>> result = list_split_and_reverse(a_list[:-1])Output: List has odd number of elements, fail! # result is also empty/None>>> result = list_split_and_reverse(a_list)>>> print(result)Output: ([0, 2, 3], [20, 10, 7])>>> result1, result2 = list_split_and_reverse([0, 1, 2, 4])>>> print(result1)Output: [0, 1]>>> print(result2)Output: [4, 2]
1. Write a function called chop that takes a list, modifies it by removing the first and last elements, and returns None. For example: >>> t = [1, 2, 3, 4, 5, 6] >>> chop(t) >>> t [2, 3, 4, 5] 2. Write a function called list_median that takes a list and returns a new list. If the list has even numbers of elements, the new list will have two elements. If the list has odd numbers of elements, the new list will include only one element. For example: >>> t1 = [5, 1, 2, 3, 4] >>> list_median(t1) [3] >>> t2 = [8, 3, 10, 6] >>> list_median(t2) [6, 8] 3. Write a function called has_duplicates that takes a list and returns True if there is any element that appears more than once. It should not modify the original list. For example: >>> t1 = [5, 1, 2, 3, 4] >>> has_duplicates(t1) False >>> t2 = [5, 1, 2, 3, 2, 8, 10] >>> has_duplicates(t2) True
Q5) A function foo has been analyzed to run with O(n2) complexity to process a list of size n.Assuming this function takes 6 seconds to process a list of size 100, how many seconds would you expect it to take to for this function to process a list of size 200?
Use Standard ML Code: Write a function that returns the factorial of a number. Write a function that sums all numbers in a list of pairs. e.g.: sum_of_pairs [(1, 2), (4, 3), (2, 5)] should return 17 (which is equal to 1 + 2 + 4 + 3 + 2 + 5) Write a function to return a list of second elements in a list of pairs. e.g.: sends [(1, 2), (4, 3), (2, 5)] should return [2, 3, 5]।
3 Write a function to generate a date string given numeric values for month, day, and year, and a language. The valid languages are "US English", "British English", "French", and "German". If US English is specified the returned string should be in the format of month day, year. For all other languages, the returned string should use the European standard of day month year. In this problem, we are going to rework the internal data representation. Instead of using lists for the months, use a dictionary with the following specification: keys 1-12 return a tuple containing the month strings for each language. An example tuple ("January", "Janvier", "Januar") Use a key for each language. The value associated with the language key should be the index to use with the month tuple. Given the example tuple above the "German" key should return a value of 2. You can assume that the numeric inputs to the function are valid. Example outputs: January 25, 2022 25 Januar 2022 Write a test function…
Please write it in Python Write a delete function that takes as an argument a list l and an elem element and returns the list obtained from l by deleting all occurrences of elem. Example: delete([4, 7, 12, 4, 4, 0, 4, 5], 4) return => [7, 12, 0, 5]. 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) return => [4, 7, 0, 12, 3] and insere_milieu([9, 3, 5, 6, 2], 1) return => [9, 3, 1, 5, 1, 6, 2]. Write a cutting function that takes as an argument a list of numbers l and a threshold number and returns two lists: the first is obtained from l keeping only the numbers below or equal to the threshold; the second is obtained from l keeping only the…
#### Part 1 Write a Python function (`binary_search`) that implements the binary search algorithm. This function will take a list argument (`values`), a value to search for (`to_find`), a start index (`start_index`), and an end index (`end_index`). The function will return `True` if `to_find` is present in `values`, and `False` otherwise. Below, you will find some code to test your binary search: ```python values = [2,4,6,8,10,12,14,16,18,20] print(binary_search(values, 14, 0, len(values) - 1)) print(binary_search(values, 7, 0, len(values) - 1)) ``` The output of the test code is below: ``` True False ``` #### Part 2 Modify your `binary_search` function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the `True` or `False` result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Some…
Python Programming - (Duplicate Elimination) Part 1: Create a function that receives a list and returns a (possibly shorter) list containing only the unique values in sorted order. Test your function with a list of numbers and a list of strings. Program is to also display results, that's the sorted list containing values. Part 2: Instead of hard coding the list passed to the sorting functions, request list values from user. (Hint: Request two lists from user, one containing values and another containing string.) Have the program eliminate duplicated values and display the lists (tasks required in part 1).