USING PYTHON Chapter 5 -Programming Project: Implement a function that takes in two sorted lists and merges them into one list, the new list must be sorted. The function MUST run in O(m+n), where m is the length of list 1 and n the length of list 2. In other words, the function cannot do more than one pass on list 1 and list 2.

USING PYTHON Chapter 5 -Programming Project: Implement a function that takes in two sorted lists and merges them into one list, the new list must be sorted. The function MUST run in O(m+n), where m is the length of list 1 and n the length of list 2. In other words, the function cannot do more than one pass on list 1 and list 2.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 16PE

See similar textbooks

Similar questions

Please answer it in Python Write a function min_pair 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. Example: min_pairs([4, 7, 12, 0, 21, 5]) is 0 min_pairs([9, 3, 1]) is None. min_pair([16, 13, 10, 102, 7, 23]) is 10
Please answer it in Python Write a decale function that takes as an argument a list l and a number d and returns the list obtained from l by adding an offset of d to each element of l. Example: decale([4, 17, 12], 3) is [7, 20, 15]. Write a function intercale_zeros that takes as an argument a list l and returns the list obtained from l by inserting a zero after each element of l. Example: intercale_zeros([4, 17, 12]) is [4, 0, 17, 0, 12, 0].
Write a python code that returns the maximum and minimum value in a list using recursion functions.1. Write a function that finds the maximum value in a list of numbers. The maximum value in a list is either the first number or the biggest of the remaining numbers. 2. Write a function that finds the minimum value in a list of numbers. The minimum value in a list is either the first number or the biggest of the remaining numbers. The minimum expectation is that you test your code for the following examples. You could get the list from the user or hard coded in your program.List1={3,4,50,23,45 }List2={12, 65,21, 34, 88}
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
In Python: Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed. It's ok if the list becomes empty after calling the function.
this code should be in python: write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.
Write a recursive Python function named initList to create a list containing the values from 0 to n-1. • The function takes two parameters, a reference to the list and an integer which is the value n. In the main program you must: - initialize a list (L = []) - call the recursive function initList with this list L, to modify it - and, ask the user to enter the value n from the keyboard
use haskell haskell haskell haskell to write following : --> A function that is passed in a function f and a list. It should apply f to every element of your list and return the resulting list. --> A function that is passed in a list and returns the count of the smallest value of the list.
Create a recursive function with arguments N and K in python 3 that does the following specifications:Using numbers ranging from 0 to 15 (inclusive), create all possible lists which sum up to K and have a length of N. Duplicated numbers are allowed as long as it fulfills the conditions above (this means [0,0,1], [0,1,0] and [1,0,0] are all correct outputs if K=1 and N=3) The function returns the number of created lists which follow the specifications mentioned. For example, given K=23 and N=2, the expected output of the function is 8. Constraints:1) The time complexity must be O(n) or faster. Indicate the time complexity of created code as proof.(Redundant due to constraint above, but still it is important to note that the function must be able to finish in 9 seconds or less when N=10)2) You are not allowed to use external libraries or itertools.
Write a recursive function sumlist(my_list) to calculate the sum of the numbers in a list my_list passed as a parameter. The sum of a list is the sum of the head (first element) plus the sum of the tail (all the other elements). Test your function by creating a program that uses sumlist(my_list) to calculate and print the sum of the following list: my_list = [7, 5, 4, 27, 52, 42, 13, 17]
C Language Write a program to take two numerical lists of the same length ended with sentinel value and store the lists in array X and array Y, each of which has 20 elements. Let N be the actual number of data values in each list. Store the product of corresponding elements of array X and array Y into third array Z of size 20. Display the square root of the sum of the items in array Z. Make up your own data and be sure to test your program on at least one data set with number exactly 20 items.
Most languages do not have the flexible built-in list (array) operationsthat Python has. Write an algorithm for each of the following Pythonoperations and test your algorithm by writing it up in a suitable function. For example, as a function, reverse (myList ) should do the same asmy List . reverse ( ) . Obviously, you are not allowed to use the corresponding Python method to implement your function.a) count (my List , x) (like my List . count (x) )b) isin(myList , x) (like x in myList))c) index (my List , x) (like my List . index (x) )d) reverse (myList) (like myList . reverse ())e) sort (myList) (like my List . sort ())