t strange_sum(List li) { •n strange_sum_helper(li, 0,

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
2. R(N) is the running time of strange_sum when called on a List of length N. Since this is
recursive code, your answer to iii should include a diagram of the recursion tree.
a. Answer for li being an ArrayList
b. Answer for li being a LinkedList
static int strange_sum(List<E> li) {
return strange_sum_helper(li, 0, li.size() - 1);
static int strange_sum_helper (List<E> arr, int left, int right) {
if (right - left < 0) return 0;
else if (right
else {
int mid = (left + right) / 2;
return strange_sum_helper(arr, left, mid)
left
0) return arr.get(left);
==
+ strange_sum_helper(arr, mid + 1, right);
}
}
Transcribed Image Text:2. R(N) is the running time of strange_sum when called on a List of length N. Since this is recursive code, your answer to iii should include a diagram of the recursion tree. a. Answer for li being an ArrayList b. Answer for li being a LinkedList static int strange_sum(List<E> li) { return strange_sum_helper(li, 0, li.size() - 1); static int strange_sum_helper (List<E> arr, int left, int right) { if (right - left < 0) return 0; else if (right else { int mid = (left + right) / 2; return strange_sum_helper(arr, left, mid) left 0) return arr.get(left); == + strange_sum_helper(arr, mid + 1, right); } }
For each problem, please provide
i.
Describe the worst-case input (the input that would cause the largest running time)
Summation used to calculate number of steps for the worst case
Explanation of how the code relates to the summation
ii.
iii.
a. (loops require discussing number of iterations and steps per iteration)
b. (recursion requires a diagram)
A O bound
iv.
Transcribed Image Text:For each problem, please provide i. Describe the worst-case input (the input that would cause the largest running time) Summation used to calculate number of steps for the worst case Explanation of how the code relates to the summation ii. iii. a. (loops require discussing number of iterations and steps per iteration) b. (recursion requires a diagram) A O bound iv.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY