listsum() takes a list of integers and the list’s length. listsum() gets the sum by adding the sum of the halves. Each half is recursively divided into two until it reaches the base case (a list containing a single element or an empty list). Trace and illustrate what happens (draw the recursion of this code step-by-step using the format of the example attached.) def listsum(numlist, size):# - base case# if the list is emptyif size 0:return 0# if the list contains a single elementelif size == 1:return numlist[0]10# get the halfway point11# so we'll know where to divide the list in half12mid =size//21314# --recursive step--15# add the sum of the left side with the sum of the right side16#tip: you need to pass the left side to one function call17# and the right side to the other18return listsum(numlist[0:mid], Len(numlist[0:mid])) + listsum(numlist[mid:], Len(numlist[mid:]192021numbers=[3,5,4,1,7,2,9,8,0,6]22 print(listsum(numbers, Len(numbers)))1~323456789FROM sum(1,3,5,7,9)sum (3,5,7,9)sum (5,7,9)sum (7,9)1+3+-Csum(9)5+107+9

Solution:: In the given program you have to fill in the blanks in order to complete the program.…

Answered: listsum() takes a list of integers and…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

listsum() takes a list of integers and the list’s length. listsum() gets the sum by adding the sum of the halves. Each half is recursively divided into two until it reaches the base case (a list containing a single element or an empty list).

Trace and illustrate what happens (draw the recursion of this code step-by-step using the format of the example attached.)

def listsum(numlist, size):
# - base case
# if the list is empty
if size 0:
return 0
# if the list contains a single element
elif size == 1:
return numlist[0]
10
# get the halfway point
11
# so we'll know where to divide the list in half
12
mid =
size//2
13
14
# --recursive step--
15
# add the sum of the left side with the sum of the right side
16
#tip: you need to pass the left side to one function call
17
# and the right side to the other
18
return listsum(numlist[0:mid], Len(numlist[0:mid])) + listsum(numlist[mid:], Len(numlist[mid:]
19
20
21
numbers
=
[3,5,4,1,7,2,9,8,0,6]
22 print(listsum(numbers, Len(numbers)))
1~3
2
3
4
5
6
7
8
9
FROM

sum(1,3,5,7,9)
sum (3,5,7,9)
sum (5,7,9)
sum (7,9)
1+
3+
-C
sum(9)
5+
10
7+
9

Expert Solution

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions