Q1. Analyze the time complexity for following code segments/ functions. i. 1. int count = 0; 2. for (int i n; i> 0; i /= 2) 3. ii. for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) PRINT "HELLO JUET !" ; for (int j= 0; j a[J+1] then, Set temp = a[J] Set a[J] = a[J+1] Set a[J+1] = temp 2. 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<=n; j = j++) for (int k=1; k<=n; k = k * 2) 3. For J = I+1 to (n-1) 4. If a[ min] > a[J] 5. min=J count++; 6. Set temp = a[min] Set a[min] = a[I] Set a[I] = temp 7. 8.

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
icon
Related questions
Question
Q1. 7 and 8 subpart only
Q1. Analyze the time complexity for following code segments/ functions.
i.
1. int count =0;
2. for (int i = n; i> 0; i /= 2)
3.
ii.
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;
4.
iii.
iv.
void fun(int n, int arr[])
1. {
int i = 0
if (n==1)
return;
2.
for (int i=1; i<=n; i++)
{
3.
for(; i<n; i++)
for (int j=1; j<=n; j++)
{
for(j=0;j <n && arr[i] < arr[j];j++)
4.
5.
Print"i+j";
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.
for (int k-1; k<=n; k = k * 2)
5.
count++;
6.
}
vii.
vii.
void function(int n)
{
int count = 0;
for (int i-n/2; i<=n; i++)
for (int j=1; j+n/2<=n; j = j++)
1. For I = 0 to n-2
2.
min=I
3.
For J = I+1 to (n-1)
4.
If a[min] > a[J]
for (int k=1; k<=n; k = k * 2)
count++;
5.
min=J
Set temp = a[min]
Set a[min] = a[I]
Set a[I] = temp
6.
7.
8.
Transcribed Image Text:Q1. Analyze the time complexity for following code segments/ functions. i. 1. int count =0; 2. for (int i = n; i> 0; i /= 2) 3. ii. 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; 4. iii. iv. void fun(int n, int arr[]) 1. { int i = 0 if (n==1) return; 2. for (int i=1; i<=n; i++) { 3. for(; i<n; i++) for (int j=1; j<=n; j++) { for(j=0;j <n && arr[i] < arr[j];j++) 4. 5. Print"i+j"; 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. for (int k-1; k<=n; k = k * 2) 5. count++; 6. } vii. vii. void function(int n) { int count = 0; for (int i-n/2; i<=n; i++) for (int j=1; j+n/2<=n; j = j++) 1. For I = 0 to n-2 2. min=I 3. For J = I+1 to (n-1) 4. If a[min] > a[J] for (int k=1; k<=n; k = k * 2) count++; 5. min=J Set temp = a[min] Set a[min] = a[I] Set a[I] = temp 6. 7. 8.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Database connectivity
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education