Open In App

Python | Accumulative index summation in tuple list

Sometimes, while working with data, we can have a problem in which we need to find accumulative summation of each index in tuples. This problem can have applications in web development and competitive programming domain. Let’s discuss certain way in which this problem can be solved. 

Method 1: Using accumulate() + sum() + lambda + map() + tuple() + zip() The combination of above functions can be used to solve this task. In this, we pair the elements using zip(), then we perform the sum of them and we extend this to all elements using map(). The taking forward of sum is done by using accumulate. The binding of all logic is done by lambda function. 






# Python3 code to demonstrate working of
# Accumulative index summation in tuple list
# Using accumulate() + sum() + lambda + map() + tuple() + zip()
from itertools import accumulate
 
# initialize list
test_list = [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
 
# printing original list
print("The original list : " + str(test_list))
 
# Accumulative index summation in tuple list
# Using accumulate() + sum() + lambda + map() + tuple() + zip()
res = list(accumulate(test_list, lambda i, j: tuple(map(sum, zip(i, j)))))
 
# printing result
print("Accumulative index summation of tuple list : " + str(res))

Output
The original list : [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
Accumulative index summation of tuple list : [(3, 4, 5), (7, 9, 12), (8, 13, 22)]

Time complexity: O(nm), where n is the number of tuples in the list and m is the length of each tuple. This is because the program iterates over each tuple in the list once and performs an operation on each element of the tuple.
Auxiliary space: O(nm), as the program creates a new list of tuples to store the result of the operation performed on each tuple in the original list.



Method #2: Using numpy.cumsum()

Note: Install numpy module using command “pip install numpy”

This method uses the cumsum() function from the numpy library to perform the cumulative sum of the tuple list. This function takes the input array and performs the cumulative sum along the specified axis.




import numpy as np
 
# initialize list
test_list = [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
 
# printing original list
print("The original list : " + str(test_list))
 
# Using numpy.cumsum()
res = np.cumsum(test_list, axis=0)
 
# printing result
print("Accumulative index summation of tuple list : " + str([tuple(i) for i in res]))
#This code is contributed by Edula Vinay Kumar Reddy

Output :

The original list : [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
Accumulative index summation of tuple list : [(3, 4, 5), (7, 9, 12), (8, 13, 22)]

Time Complexity : O(n)
Auxiliary Space : O(n)

Method 3: Using list comprehension

Use a loop to iterate over the tuples in the test_list. For each iteration, extract the first i+1 tuples from the test_list and use the zip function to group the elements with the same index into tuples. then calculate the sum of each of these tuples using a list comprehension and the sum function. Finally, we convert the resulting list of sums into a tuple using the tuple function and append it to the cumulative_sum list.




test_list = [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
 
# Initialize an empty list to store the cumulative sums
cumulative_sum = []
 
# Loop over the tuples in the test_list
for i in range(len(test_list)):
     
    # Extract the i+1 tuples from the test_list and calculate the sum of each element
    temp_sum = tuple(sum(y) for y in zip(*test_list[:i+1]))
     
    # Append the cumulative sum to the list
    cumulative_sum.append(temp_sum)
 
print("Accumulative index summation of tuple list : " + str(cumulative_sum))

Output
Accumulative index summation of tuple list : [(3, 4, 5), (7, 9, 12), (8, 13, 22)]

Time complexity: O(n^2), where n is the number of tuples in the test_list. 
Auxiliary space: O(n^2), as we store the cumulative sums in a list that has the same length as the test_list. 

Method 4: Using a for loop to iterate over the tuples and calculate the cumulative index summation.

The implementation uses a for loop to iterate over the tuples in the list. If the result list is empty, the current tuple is appended to the result. Otherwise, the previous tuple in the result is retrieved and a new tuple is calculated by adding the corresponding elements of the two tuples. The new tuple is then appended to the result list.




# initialize list
test_list = [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
 
# printing original list
print("The original list : " + str(test_list))
 
# Accumulative index summation in tuple list
# Using for loop
res = []
for tup in test_list:
    if not res:
        res.append(tup)
    else:
        last_tup = res[-1]
        new_tup = tuple(last_tup[i] + tup[i] for i in range(len(tup)))
        res.append(new_tup)
 
# printing result
print("Accumulative index summation of tuple list : " + str(res))

Output
The original list : [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
Accumulative index summation of tuple list : [(3, 4, 5), (7, 9, 12), (8, 13, 22)]

Time complexity: O(n*m), where n is the number of tuples in the list and m is the length of each tuple.
Auxiliary space: O(n*m), where n is the number of tuples in the list and m is the length of each tuple.

Method 5: Using itertools.accumulate()

Use the accumulate() function from the itertools module to calculate the cumulative sum of each tuple element-wise. Here’s how you can do it:




import itertools
 
test_list = [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
 
res = list(itertools.accumulate(test_list, lambda x, y: tuple(xi + yi for xi, yi in zip(x, y))))
 
print("Accumulative index summation of tuple list : " + str(res))

Output
Accumulative index summation of tuple list : [(3, 4, 5), (7, 9, 12), (8, 13, 22)]

Time complexity: O(n), where n is the length of the input list test_list. 
Auxiliary space: O(n), because the accumulate() function returns a new list that contains the cumulative sums.

Method 6: Using Recursive method.

Step-by-step approach:




def accumulative_sum(tuples, index=0, accumulative_tuple=()):
    if index == len(tuples): # base case - reached the end of the list
        return []
    else:
        tup = tuples[index]
        if not accumulative_tuple: # if this is the first tuple
            new_tup = tup
        else:
            new_tup = tuple(accumulative_tuple[i] + tup[i] for i in range(len(tup)))
        rest_of_list = accumulative_sum(tuples, index+1, new_tup)
        return [new_tup] + rest_of_list
 
test_list = [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
res=accumulative_sum(test_list)
print("Accumulative index summation of tuple list : " + str(res))

Output
Accumulative index summation of tuple list : [(3, 4, 5), (7, 9, 12), (8, 13, 22)]

Time complexity: O(n), where n is the number of tuples in the list. This is because the algorithm needs to process each tuple in the list once.
Auxiliary space: O(n), because the space used by the algorithm depends on the size of the input list. The algorithm creates a new list to store the result, which can have at most n tuples. Additionally, the algorithm uses a constant amount of space to store loop variables and temporary tuples.

Method 7: Using reduce() function from functools module




from functools import reduce
 
def accumulative_sum(tuples):
    return reduce(lambda acc, curr: acc + [tuple(map(sum, zip(curr, acc[-1])))], tuples[1:], [tuples[0]])
 
test_list = [(3, 4, 5), (4, 5, 7), (1, 4, 10)]
res = accumulative_sum(test_list)
print("Accumulative index summation of tuple list : " + str(res))

Output
Accumulative index summation of tuple list : [(3, 4, 5), (7, 9, 12), (8, 13, 22)]

Time complexity: O(n^2), since the reduce() function iterates over the tuples in the list once for each tuple.
Auxiliary space: O(n), since we are creating a new list of tuples to store the cumulative sum.


Article Tags :