Question

I was looking for a new version of the solution using python 3. Consider summing up the values in a sequence A of n integers, where n is a power of two. Create a new sequence B of half the size of A and set B[i] = A[2i]+A[2i+ 1]; for i = 0; 1; :::;(n=2) 1. If B has size 1, then output B[0]. Otherwise, replace A with B, and repeat the process. What is the running time of this algorithm

Answer 1

def method1(A):
    while(True):
        B = [0 for x in range(len(A)//2)]
        for x in range(len(A)//2):
            B[i] = A[2*i]+A[2*i + 1]
        if(len(B) == 1):
            return B[0]
        else:
            A = B

$\color{red}Please\; upvote\;the \;solution \;if \;it \;helped.\;Thanks!$