. 5 and 6 subparts only if you do both then only
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
Q1. 5 and 6 subparts only if you do both then only I will provide upvote
![Q1. Analyze the time complexity for following code segments/ functions.
i.
ii.
1. int count = 0;
2. for (int i = n; i> 0; i /= 2)
3.
4.
for (i=1; i<=n; i++)
for (j=1; j<=log(i); j++)
PRINT "HELLO JUET !";
for (int j= 0; j<i; j++)
count += 1;
iii.
iv.
void fun(int n, int arr[])
1. {
2.
if (n==1)
return;
for (int i=1; i<=n; i++)
{
int i = 0
for(; i< n; i++)
4.
3.
for (int j=1; j<=n; j++)
{
for(j=0;j <n && arr[i] < arr[j];j++)
Print'i+j";
5.
printf("*");
break;
6. }
}
V.
vi.
1.For I = 1 to n-1
void function (int n)
{
int count = 0;
for (int i-n/2; i<=n; i++)
for (int j=1; j<=n; j = 2 *j)
2.
For J = 0 to (n-I-1)
If a[J] > a[J+1] then,
Set temp = a[J]
Set a[J] = a[J+1]
Set a[J+1] = temp
3.
4.
5.
for (int k=1; k<=n; k = k * 2)
count++;
6.
vii.
viii.
void function (int n)
1. For I = 0 to n-2
2.
min=I
int count = 0;
for (int i-n/2; i<=n; i++)
for (int j=1; j+n/2<3Dn; j = j++)
for (int k=1; k<=n; k = k * 2)
For J= I+1 to (n-1)
If a[min] > a[J]
3.
4.
5.
min=J
count++;
Set temp = a[min]
Set a[min] = a[I]
Set a[I] = temp
6.
7.
8.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1efce420-53bb-47ed-8ea3-349f71cd78ff%2Fce726b19-ea87-4e89-8822-740d1d354b32%2F7uuhm_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Q1. Analyze the time complexity for following code segments/ functions.
i.
ii.
1. int count = 0;
2. for (int i = n; i> 0; i /= 2)
3.
4.
for (i=1; i<=n; i++)
for (j=1; j<=log(i); j++)
PRINT "HELLO JUET !";
for (int j= 0; j<i; j++)
count += 1;
iii.
iv.
void fun(int n, int arr[])
1. {
2.
if (n==1)
return;
for (int i=1; i<=n; i++)
{
int i = 0
for(; i< n; i++)
4.
3.
for (int j=1; j<=n; j++)
{
for(j=0;j <n && arr[i] < arr[j];j++)
Print'i+j";
5.
printf("*");
break;
6. }
}
V.
vi.
1.For I = 1 to n-1
void function (int n)
{
int count = 0;
for (int i-n/2; i<=n; i++)
for (int j=1; j<=n; j = 2 *j)
2.
For J = 0 to (n-I-1)
If a[J] > a[J+1] then,
Set temp = a[J]
Set a[J] = a[J+1]
Set a[J+1] = temp
3.
4.
5.
for (int k=1; k<=n; k = k * 2)
count++;
6.
vii.
viii.
void function (int n)
1. For I = 0 to n-2
2.
min=I
int count = 0;
for (int i-n/2; i<=n; i++)
for (int j=1; j+n/2<3Dn; j = j++)
for (int k=1; k<=n; k = k * 2)
For J= I+1 to (n-1)
If a[min] > a[J]
3.
4.
5.
min=J
count++;
Set temp = a[min]
Set a[min] = a[I]
Set a[I] = temp
6.
7.
8.
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