1. Consider the algorithm encoded as a Java method given below. Assume that the array referred to by vals is square and that the values stored in vals are uniformly distributed, which means that any integer is equally likely to occur in any element of the array. Let n denote the number of rows in the vals array. public static int sumRows ThatStartWithEven (int[][] vals) { int total = 0; } for (int row=0; row < vals.length; row++) { // if first element of row is even... if (vals[row][0] % 2 == 0) { for (int col=0; col < vals[row].length; col++) { total = total + vals[row][col]; } return total; a. Give and briefly justify a (•) bound for the best-case running time of this algorithm, in terms of n. b. Give and briefly justify a O(•) bound for the worst-case running time of this algorithm, in terms of n. c. Give and briefly justify a (•) bound for the average-case running time of this algorithm, in terms of n.
1. Consider the algorithm encoded as a Java method given below. Assume that the array referred to by vals is square and that the values stored in vals are uniformly distributed, which means that any integer is equally likely to occur in any element of the array. Let n denote the number of rows in the vals array. public static int sumRows ThatStartWithEven (int[][] vals) { int total = 0; } for (int row=0; row < vals.length; row++) { // if first element of row is even... if (vals[row][0] % 2 == 0) { for (int col=0; col < vals[row].length; col++) { total = total + vals[row][col]; } return total; a. Give and briefly justify a (•) bound for the best-case running time of this algorithm, in terms of n. b. Give and briefly justify a O(•) bound for the worst-case running time of this algorithm, in terms of n. c. Give and briefly justify a (•) bound for the average-case running time of this algorithm, in terms of n.
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
![1. Consider the algorithm encoded as a Java method given below. Assume that the
array referred to by vals is square and that the values stored in vals are uniformly
distributed, which means that any integer is equally likely to occur in any element of
the array. Let n denote the number of rows in the vals array.
public static int sumRows That StartWithEven (int[][] vals) {
int total = 0;
}
for (int row=0; row < vals.length; row++) {
// if first element of row is even...
if (vals [row][0] % 2
== 0) {
for (int col=0; col < vals[row].length; col++) {
total = total + vals[row][col];
}
return total;
a. Give and briefly justify a (•) bound for the best-case running time of this
algorithm, in terms of n.
b. Give and briefly justify a O(•) bound for the worst-case running time of this
algorithm, in terms of n.
c. Give and briefly justify a ✪( • ) bound for the average-case running time of this
algorithm, in terms of n.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F832196dd-2d45-47e5-91ed-72a7273417b1%2Fd45972b4-f28b-4741-8279-890de859de41%2F2q536el_processed.png&w=3840&q=75)
Transcribed Image Text:1. Consider the algorithm encoded as a Java method given below. Assume that the
array referred to by vals is square and that the values stored in vals are uniformly
distributed, which means that any integer is equally likely to occur in any element of
the array. Let n denote the number of rows in the vals array.
public static int sumRows That StartWithEven (int[][] vals) {
int total = 0;
}
for (int row=0; row < vals.length; row++) {
// if first element of row is even...
if (vals [row][0] % 2
== 0) {
for (int col=0; col < vals[row].length; col++) {
total = total + vals[row][col];
}
return total;
a. Give and briefly justify a (•) bound for the best-case running time of this
algorithm, in terms of n.
b. Give and briefly justify a O(•) bound for the worst-case running time of this
algorithm, in terms of n.
c. Give and briefly justify a ✪( • ) bound for the average-case running time of this
algorithm, in terms of n.
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 4 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