what is an algorithm that generates a new list where after the first element subsequent elements...

Question

Question

what is an algorithm that generates a new list where after the first element subsequent elements...

what is an algorithm that generates a new list where after the first element subsequent elements are determined from previous elements

python

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

SOURCE CODE IN PYTHON:

#function to create a new list from given list such that

#each element is sum of previous elements upto that position

def listChange(list):

newList=[list[0]] #creating new list with first element of current list

sum=list[0] #to store sum upto current element

for i in range(1,len(list)):

sum+=list[i] #updating sum

newList.append(sum) #appending to new list

return newList #returning new list

#testing the function

print(listChange([1,2,3,4]))

print(listChange([1,-2,3,-4]))

OUTPUT:

Add a comment

Answer 2

Similar Homework Help Questions

what is an algorithm that generates a new list where after the first element subsequent elements...

what is an algorithm that generates a new list where after the first element subsequent elements are determined from previous elements
To swap two elements of a python list, I need: Select one: a. a new element...

To swap two elements of a python list, I need: Select one: a. a new element at the beginning of the list b. a new element at the end of the list Question text To swap the content of two nodes from a doubly-linked-list, I need: Select one: a. a reference to previous only. b. a reference to previous and a reference to next. c. a temporary Doubly-Linked-List node. d. a temporary variable to contain an object. Question text To...
Write an algorithm to find the sum of n elements after a kth smallest element in...

Write an algorithm to find the sum of n elements after a kth smallest element in Binary Search Tree. (Java)

What will be the resulting list after the following algorithm has been applied to the list:...

What will be the resulting list after the following algorithm has been applied to the list: {21, 17, 23, 3, 42, 9, 30} where first = 1 and last = 7. [10 pts] Int Partition (list, first, last) PivotValue = list[ first ] PivotPoint = first for index = first+1 to last do if list[ index ] < PivotValue then PivotPoint = PivotPoint + 1 Swap( list[ PivotPoint ], list[ index ] ) end if...
1)Given two lists L1 and L2, create a new list L3 consisting of the first element...

1)Given two lists L1 and L2, create a new list L3 consisting of the first element of L1 and the last element of L2. For example, if L1=[1,2,3] and L2=["a","b","c"], L3 should be [1,"c"] 2)given a string s, create a new string odd_letters that contains only the odd letters of s (two ways to solve this problem are to use slicing, or a while or for loop), i.e. starting at the first letter or the zeroth index: if s="banana", odd_letters...
Discrete Structure Question- In a list of elements a1…an, the same element may appear several tim...

Discrete Structure Question- In a list of elements a1…an, the same element may appear several times. A mode of such a list is a value that occurs most often; a list has more than one mode when more than one value appears the maximum number of times. Devise an algorithm(pseudocode) that finds a mode in list of integers. What is the complexity (big-O) of your algorithm? Discrete Maths Question. Can someone please help me with this question with full solution...

Here is the IntegerLinkedList_incomplete class: public class IntegerLinkedList { static class Node { /** The element...

Here is the IntegerLinkedList_incomplete class: public class IntegerLinkedList { static class Node { /** The element stored at this node */ private int element; // reference to the element stored at this node /** A reference to the subsequent node in the list */ private Node next; // reference to the subsequent node in the list /** * Creates a node with the given element and next node. * * @param e the element to be stored * @param n...
Using the algorithm of selection sort, what will be the contents of the list [10,4,7,1,0] after...

Using the algorithm of selection sort, what will be the contents of the list [10,4,7,1,0] after first and second pass
a. Use pseudocode to specify a brute-force algorithm that takes as input a list of n...

a. Use pseudocode to specify a brute-force algorithm that takes as input a list of n positive integers and determines whether there are two distinct elements of the list that have as their sum a third element of the list. That is, whether there exists i, j.k such that iヂj, i关k,j关k and ai + aj = ak. The algorithm should loop through all triples of elements of the list checking whether the sum of the first two is the third...

Implement in C SharpCreate a new algorithm based on the algorithm, selection sort. The new algorithm...

Implement in C SharpCreate a new algorithm based on the algorithm, selection sort. The new algorithm should be able to sort an array like this: Input: an array that has n elements, and the values of its elements are assigned randomly, for example: Index 0 1 2 3 4 5 value 7 3 6 2 1 5 Output: an array - its first n/2 elements are sorted in ascending order and its second n/2 elements sorted in descending order. That...

what is an algorithm that generates a new list where after the first element subsequent elements...

Homework Answers

Add Answer to:
what is an algorithm that generates a new list where after the first element subsequent elements...

Post as a guest

Earn Coins