The list method reverse reverses the elements in the list. Define a function named reverse that reverses the elements in its list argument (without using the method reverse). Try to make this function as efficient as possible, and state its computational complexity using big-O notation. Using this template in Python: def reverse_elems(input_list): reversed_list = [] #TODO: Your work here # Return reversed_list return reversed_list if __name__ == "__main__": my_list = [1, 2, 3, 4, 5] print(reverse_elems(my_list)) # Correct Output: [5, 4, 3, 2, 1]

The list method reverse reverses the elements in the list. Define a function named reverse that reverses the elements in its list argument (without using the method reverse). Try to make this function as efficient as possible, and state its computational complexity using big-O notation. Using this template in Python: def reverse_elems(input_list): reversed_list = [] #TODO: Your work here # Return reversed_list return reversed_list if name == "main": my_list = [1, 2, 3, 4, 5] print(reverse_elems(my_list)) # Correct Output: [5, 4, 3, 2, 1]

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 18PE

See similar textbooks

Similar questions

write a Python function that takes in a list of integers (nums) and finds whether the list consists of any duplicate numbers, the function returns True or False accordingly (Note: this is not a linked list, just a Python list). Function must run in place and cannot use Python’s built-in Set() structure. Make sure to provide the most efficient algorithm in terms of its time and space complexity.
Write a Python function `removeDuplicates(myList)` that removes duplicate values from a list. While the algorithm for this problem might seem trivial, its implementation is not. In general, it is not advisable to modify a list while you are iterating on it, as in the following pseudo-code: for element in myList: if <condition>: <remove element(s) from myList> # recipe for disaster
Write a program in python with a function isPal(L), where L is a list of integers, and the function returns True if the list is a palindrome, False otherwise. For example [5, 2, 9, 9, 2 5] is a palindrome. Use the reverse() method of list and check if the reversed list is the same as the original list.
Write a function that takes a list removal(L), delete from it all the elements whose indicesare divisible by 3. And return the resulting list after removing unwanted elements.Example:>>>removal(['A', 'B', 'C', 'D', 'E'])['B', 'C','E'
Write a Python Code for the given function and conditions: Given function: def insert(self, newElement) Pre-condition: None. Post-condition: This method inserts newElement at the tail of the list. If an element with the same key as newElement already exists in the list, then it concludes the key already exists and does not insert the key.
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].
Please answer it in Python Write a function extrait_pairs that takes as an argument a list l1 and returns the list obtained from l1 keeping only the even integers (and without changing their order). Be careful, l1 must not be modified by the function. Example: extrait_pairs([4, 7, 12, 0, 3]) is [4, 12, 0] and extrait_pairs([21, 17, 3]) is [ ].
Implement a function countMultiples in Python that: accepts a single argument, a 2-dimensional list (e.g, list of lists) containing non-negative integers, and returns the count of those integers that are multiples of 5 but that are not not multiples of 10. (e.g., 65 should be counted, but 80 should not be counted) sample usage: >>> countMultiples( [[1,2,3],[4,5],[6,7,8,9]] ) # 5 counts1
Implements clone which duplicates a list. Pay attention, because if there are sublists, they must be duplicated as well. Understand the implementation of the following function, which recursively displays the ids of each node in a list Develop your solution as follows: First copy the nodes of the current list (self) Create a new list with the copied nodes Loop through the nodes of the new list checking the value field If this field is also a list (use isinstance as in the show_ids function) then it calls clone on that list and substitutes the value. Complete the code: def L4(*args,**kwargs): class L4_class(L): def clone(self): def clone_node(node): return <... YOUR CODE HERE ...> r = <... YOUR CODE HERE...> return r return L4_class(*args,**kwargs)
Your solutions can use:• the [] operator to get and set list elements (e.g., lst[i] and lst[i] = a)• the in and not in operators (e.g., a in lst)• the list concatenation operator (e.g., lst1 + lst2)• the list replication operator (e.g., lst * n or n * lst)• Python's built-in len, min and max functions, unless otherwise noted.Your solutions cannot use:• list slicing (e.g., lst[i : j] or (lst[i : j] = t)• the del statement (e.g., del lst[0])• Python's built-in reversed and sorted functions.• any of the Python methods that provide list operations, e.g., sum, append, clear, copy, count, extend, index, insert, pop, remove, reverse and sort• list comprehensions Automated testing is required using python language Use the function design recipe to develop a function named Fibonacci_sequence. The function takes an integer n. The function returns a list containing the Fibonacci sequence, up until the nth term. The Fibonacci sequence is defined as Fn = Fn-1 + Fn-2. For example, if n = 6, then the…
Complete the examples in the docstring and then write the body of thefollowing function:def same_first_last(L):""" (list) -> boolPrecondition: len(L) >= 2Return True if and only if first item of the list is the same as thelast.>>> same_first_last([3, 4, 2, 8, 3])True>>> same_first_last(['apple', 'banana', 'pear'])>>> same_first_last([4.0, 4.5])"""
Implements clone which duplicates a list. Pay attention, because if there are sublists, they must be duplicated as well. Understand the implementation of the following function, which recursively displays the ids of each node in a list def show_ids(M, level=0): k = M.first_node while k is not None: print(" "*2*level, id(k)) if (str(k.value.__class__.__name__) == str(M.__class__.__name__)): show_ids(k.value, level+1) k = k.next W=L2(Node(10, Node(L2(Node(14, Node(15, Node(L2(Node(16, Node(17))))))), Node(20, Node(30)))) )show_ids(W) Develop your solution as follows: - First copy the nodes of the current list (self) - Create a new list with the copied nodes - Loop through the nodes of the new list checking the value field - If this field is also a list (use isinstance as in the show_ids function) then it calls clone on that list and substitutes the value. Complete the code: def L4(*args,**kwargs): class L4_class(L):…