Find the complexity of the following blocks of code or algorithm's description. [Note: your answer must show the steps that lead to your final answer] 2) count = 1 for i = 1 to n do count += i for k = 1 to n do 1) count = 0 for i = 1 to n do for k = 1 to n do for (j = 2; j
Find the complexity of the following blocks of code or algorithm's description. [Note: your answer must show the steps that lead to your final answer] 2) count = 1 for i = 1 to n do count += i for k = 1 to n do 1) count = 0 for i = 1 to n do for k = 1 to n do for (j = 2; j
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
Related questions
Question
hi can you help
![Question 4:
Find the complexity of the following blocks of code or algorithm's description.
[Note: your answer must show the steps that lead to your final answer]
1) count = 0
for i = 1 to n do
for k = 1 to n do
2)
for i = 1 to n do
count += i
count = 1
for (j = 2;j<n;j *= 2)
count = i +k + j;
for k = 1 to n do
count *= k
end for
k +=2
while j< n do
count +=j
j*= 2;
end while
The algorithm solves the problem
of size n by recursively solving
sub-problems of size n – 1, and
then combining the solutions in
Q(n) time.
end for
end for
3) The algorithm solves the problem of 4)
size n by dividing it into 64 sub-
problems of size n/8, recursively
solving each sub-problem, and then
combining the solutions in O(n?)
time
5) The algorithm solves the problem
by breaking it into 8 sub-problems
of 1/4 the scale, recursively solving
each sub-maze, and then
combining the solutions in linear
time](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdeec4bd4-2c28-47bc-8577-aa629f0c130e%2F79481e2d-35bb-4792-b74a-1350abf1bf81%2F4zg09gn_processed.png&w=3840&q=75)
Transcribed Image Text:Question 4:
Find the complexity of the following blocks of code or algorithm's description.
[Note: your answer must show the steps that lead to your final answer]
1) count = 0
for i = 1 to n do
for k = 1 to n do
2)
for i = 1 to n do
count += i
count = 1
for (j = 2;j<n;j *= 2)
count = i +k + j;
for k = 1 to n do
count *= k
end for
k +=2
while j< n do
count +=j
j*= 2;
end while
The algorithm solves the problem
of size n by recursively solving
sub-problems of size n – 1, and
then combining the solutions in
Q(n) time.
end for
end for
3) The algorithm solves the problem of 4)
size n by dividing it into 64 sub-
problems of size n/8, recursively
solving each sub-problem, and then
combining the solutions in O(n?)
time
5) The algorithm solves the problem
by breaking it into 8 sub-problems
of 1/4 the scale, recursively solving
each sub-maze, and then
combining the solutions in linear
time
Expert Solution
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 with 16 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education