Algorithm prefixAvg1(X): input: An n-element array X output: An n-element array A of numbers such that A[i] is the average of elements X[@], ..., X[i] 1 Declare and initialize array A 2 for i = 0 to n-1 do 3 a = 0 4 for j = 0 to i do a += X[j] 6 A[i] = a / (i+1) 7 return array A 5 Algorithm prefixAvg2(X): input: An n-element array X output: An n-element array A of numbers such that A[i] is the average of elements X[0], ..., x[i] 1 Declare and initialize array A 2 a = e 3 for i = 0 to n-1 do 4 a += X[i] 5 A[i] = a / (i+1) 6 return array A

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

a. Determine the worst runtime complexity of both the algorithms.
b. Comment which algorithm is better than the other?

 

Algorithm prefixAvg1(X):
input: An n-element array X
output: An n-element array A of numbers such that A[i] is the average of elements X[0], ..., X[i]
1 Declare and initialize array A
2 for i = 0 to n-1 do
a = 0
4 for j = 0 to i do
a += X[j]
6 A[i] = a / (i+1)
7 return array A
3
5
Algorithm prefixAvg2(X):
input: An n-element array X
output: An n-element array A of numbers such that A[i] is the average of elements X[0], ..., X[i]
1 Declare and initialize array A
2 a = 0
3 for i = 0 to n-1 do
a += X[i]
5 A[i] = a / (i+1)
6 return array A
4
Transcribed Image Text:Algorithm prefixAvg1(X): input: An n-element array X output: An n-element array A of numbers such that A[i] is the average of elements X[0], ..., X[i] 1 Declare and initialize array A 2 for i = 0 to n-1 do a = 0 4 for j = 0 to i do a += X[j] 6 A[i] = a / (i+1) 7 return array A 3 5 Algorithm prefixAvg2(X): input: An n-element array X output: An n-element array A of numbers such that A[i] is the average of elements X[0], ..., X[i] 1 Declare and initialize array A 2 a = 0 3 for i = 0 to n-1 do a += X[i] 5 A[i] = a / (i+1) 6 return array A 4
Expert Solution
Step 1

Time Complexity:

Algorithm prefixAvg1(X) : Big O of n square that is quadratic 
    O(n*n)

 

Algorithm prefixAvg2(X) : Big O of n  that is Linear 
    O(n)


Better algorithm:  Algorithm prefixAvg2(X)

steps

Step by step

Solved in 2 steps

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