Question 1: Determine the most accurate O(...) bound for each function and explain how you calculated it. You may assume that the functions take an array a of size n as input. 1 int max(int* a, int size) 2 { 3 4 120 60 5 7 8 9 10 11 12 13 14 15 16 } 123456 2 { 7 8 9 10 11 12} 1234LO CON (b) 1 int maxElement (int* a, int size) 1 int 2 { 5 6 if (size < 2) { return -1; 7 8 9 10 11 12 13 14 15 16 17} if (a [0] > a [1]) { return a [0]; } else } return a [1]; int max = a [0]; for (int i = 1; i < size; i++) { if (a[i]> max) { a[i]; } max = return max; maxSubseqSum (int* a, int size) a [0]; for (int i = 1; i < size; i++) { int max = } Page 2 of 5 sum = 0; for (int j = i; j < size; j++) sum sum + a[j]; if (sum max) { } return max; max sum;
Question 1: Determine the most accurate O(...) bound for each function and explain how you calculated it. You may assume that the functions take an array a of size n as input. 1 int max(int* a, int size) 2 { 3 4 120 60 5 7 8 9 10 11 12 13 14 15 16 } 123456 2 { 7 8 9 10 11 12} 1234LO CON (b) 1 int maxElement (int* a, int size) 1 int 2 { 5 6 if (size < 2) { return -1; 7 8 9 10 11 12 13 14 15 16 17} if (a [0] > a [1]) { return a [0]; } else } return a [1]; int max = a [0]; for (int i = 1; i < size; i++) { if (a[i]> max) { a[i]; } max = return max; maxSubseqSum (int* a, int size) a [0]; for (int i = 1; i < size; i++) { int max = } Page 2 of 5 sum = 0; for (int j = i; j < size; j++) sum sum + a[j]; if (sum max) { } return max; max sum;
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
![Question 1:
Determine the most accurate O(...) bound for each function and explain how you calculated
it. You may assume that the functions take an array a of size n as input.
1 int max(int* a, int size)
2 {
3
4
5
6
7
8
9
10
11
12
13
14
15
16 }
4567 W N
3
8
9
1 int maxElement (int* a, int size)
2
10
11
12 }
5
6
7
8
9
if (size < 2)
{
}
if (a [0] > a[1])
{
return a [0];
10
11
12
13
14
}
else
{
}
15
16
17 }
return -1;
return a [1];
int max = a [0];
for (int i = 1; i < size; i++)
{
1 int maxSubseqSum (int* a, int size)
2 {
3
4
if (a[i] > max)
{
max = a[i];
}
}
return max;
Page 2 of 5
int max =
a [0];
for (int i = 1; i < size; i++)
sum =
0;
for int j i; j < size; j++)
{
}
sum = sum + a[j];
if (sum > max)
{
}
}
return max;
max = sum;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F474861d3-aaf1-4b4c-afe2-e250091335e4%2F52cc7c17-b7d7-4924-94ea-c0944b6bce6e%2Fu8avezk_processed.png&w=3840&q=75)
Transcribed Image Text:Question 1:
Determine the most accurate O(...) bound for each function and explain how you calculated
it. You may assume that the functions take an array a of size n as input.
1 int max(int* a, int size)
2 {
3
4
5
6
7
8
9
10
11
12
13
14
15
16 }
4567 W N
3
8
9
1 int maxElement (int* a, int size)
2
10
11
12 }
5
6
7
8
9
if (size < 2)
{
}
if (a [0] > a[1])
{
return a [0];
10
11
12
13
14
}
else
{
}
15
16
17 }
return -1;
return a [1];
int max = a [0];
for (int i = 1; i < size; i++)
{
1 int maxSubseqSum (int* a, int size)
2 {
3
4
if (a[i] > max)
{
max = a[i];
}
}
return max;
Page 2 of 5
int max =
a [0];
for (int i = 1; i < size; i++)
sum =
0;
for int j i; j < size; j++)
{
}
sum = sum + a[j];
if (sum > max)
{
}
}
return max;
max = sum;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps
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