Q-2 Find the Complexity of the following Algorithm. 1. Initialize sum to 0. 2. Initialize index variable i to 0. 3. While i =1 and an array x[0], . . . , x[n–1] of real numbers Return: The mean of x[0], . . . , x[n=1] 1. Initialize sum to 0. 2. Initialize index variable i to 0. 3. While i < n do the following: a. Add x[i] to sum. b. Increment i by 1. 6. Calculate and return mean = sum /n. n+1 4. 5. T(n) = 3n + 4
Q-2 Find the Complexity of the following Algorithm. 1. Initialize sum to 0. 2. Initialize index variable i to 0. 3. While i =1 and an array x[0], . . . , x[n–1] of real numbers Return: The mean of x[0], . . . , x[n=1] 1. Initialize sum to 0. 2. Initialize index variable i to 0. 3. While i < n do the following: a. Add x[i] to sum. b. Increment i by 1. 6. Calculate and return mean = sum /n. n+1 4. 5. T(n) = 3n + 4
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...
Related questions
Question
100%
![Q-2 Find the Complexity of the following Algorithm.
1. Initialize sum to 0.
2. Initialize index variable i to 0.
3. While i<n do the following:
a. Add x[i] to sum.
b. Increment i by 1.
c. if(sum%2)
else continue;
4.
5.
6.
7.
8. Calculate and return mean = sum / n.
Answer – T(n) =
Solve above Question like below method
Example: Calculating the Mean
7, Algorithm to find the mean of n real numbers.
Receive: integer n >= 1 and an array x[0]J, . . . , x[n=1] of real numbers
Return: The mean of x[0], .
x[n=1]
1. Initialize sum to 0.
1
2. Initialize index variable i to 0.
3. While i < n do the following:
a. Add x[i] to sum.
b. Increment i by 1.
6. Calculate and return mean = sum /n.
n+1
4.
5.
T(n) =
3n + 4](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdd4785f6-e40f-468a-aa27-ddcf0d1e36f1%2Ff83625d2-fff1-40f4-a44b-46d88a47c87d%2Fepoma5_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Q-2 Find the Complexity of the following Algorithm.
1. Initialize sum to 0.
2. Initialize index variable i to 0.
3. While i<n do the following:
a. Add x[i] to sum.
b. Increment i by 1.
c. if(sum%2)
else continue;
4.
5.
6.
7.
8. Calculate and return mean = sum / n.
Answer – T(n) =
Solve above Question like below method
Example: Calculating the Mean
7, Algorithm to find the mean of n real numbers.
Receive: integer n >= 1 and an array x[0]J, . . . , x[n=1] of real numbers
Return: The mean of x[0], .
x[n=1]
1. Initialize sum to 0.
1
2. Initialize index variable i to 0.
3. While i < n do the following:
a. Add x[i] to sum.
b. Increment i by 1.
6. Calculate and return mean = sum /n.
n+1
4.
5.
T(n) =
3n + 4
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY