State the approximate worst-case running time for each of the following. Appropriate answers are of the form “constant time” or “X in Y”, where X might be “linear,” “quadratic,” or the like, and Y is the name of the variable or quantity in question. For example, a traversal of an array is linear in the length of the array; if the array is named a, it is linear in a.length. (a) (3 points) HashMap.size (b) (3 points) ArrayList.indexOf (c) (4 points) int crossProductIsh(int[] a) { int sum = 0; for (int i = 0; i < a.length; i++) { for (int j = 0; j < a.length; j++) { sum += a[i] + a[j]; } } return sum; }
State the approximate worst-case running time for each of the following. Appropriate answers are of the form “constant time” or “X in Y”, where X might be “linear,” “quadratic,” or the like, and Y is the name of the variable or quantity in question. For example, a traversal of an array is linear in the length of the array; if the array is named a, it is linear in a.length. (a) (3 points) HashMap.size (b) (3 points) ArrayList.indexOf (c) (4 points) int crossProductIsh(int[] a) { int sum = 0; for (int i = 0; i < a.length; i++) { for (int j = 0; j < a.length; j++) { sum += a[i] + a[j]; } } return 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
State the approximate worst-case running time for each of the following.
Appropriate answers are of the form “constant time” or “X in Y”, where X might be “linear,” “quadratic,” or the like, and Y is the name of the variable or quantity in question. For example, a traversal of an array is linear in the length of the array; if the array is named a, it is linear in a.length.
(a) (3 points) HashMap.size
(b) (3 points) ArrayList.indexOf
(c) (4 points)
int crossProductIsh(int[] a) {
int sum = 0;
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++) { sum += a[i] + a[j];
} }
return 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 2 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