public List greedy(double[] points, double[] time, double timeLimit) { ArrayList retTasks = new ArrayList<>(); 6. ArrayList allTasks = new ArrayList<>(); double[] ppt = new double[points.length]; for (int i=8; i« points.length; i++) { 9. 18 allTasks.add(i); ppt[i] = EXPR1; 11 12 13 // Sorts tasks in decreasing order of ppt allTasks.sort(Comparator.comparing((Integer t)->ppt[t]).reversed()); 14 15 16 17 double timeRemaining = timeLimit; 18 for (int task : allTasks) { 19 if (EXPR2) { retTasks.add(task); timeRemaining -- time[task]; 20 21 22 23 24 return retTasks; 25 Recall that there are N tasks in total (that is, points and time both have length N). What is the big O runtime complexity of the greedy method in terms of N? Briefly explain your answer referencing the code. 637
public List greedy(double[] points, double[] time, double timeLimit) { ArrayList retTasks = new ArrayList<>(); 6. ArrayList allTasks = new ArrayList<>(); double[] ppt = new double[points.length]; for (int i=8; i« points.length; i++) { 9. 18 allTasks.add(i); ppt[i] = EXPR1; 11 12 13 // Sorts tasks in decreasing order of ppt allTasks.sort(Comparator.comparing((Integer t)->ppt[t]).reversed()); 14 15 16 17 double timeRemaining = timeLimit; 18 for (int task : allTasks) { 19 if (EXPR2) { retTasks.add(task); timeRemaining -- time[task]; 20 21 22 23 24 return retTasks; 25 Recall that there are N tasks in total (that is, points and time both have length N). What is the big O runtime complexity of the greedy method in terms of N? Briefly explain your answer referencing the code. 637
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Help me please
![public List<Integer> greedy(double[] points, double[] time, double timelimit) {
6.
ArrayList<Integer> retTasks = new ArrayList<>();
ArrayList<Integer> allTasks = new ArrayList<>();
double[] ppt = new double[points.length];
for (int i=0; i< points.length; i++) {
allTasks.add(i);
9.
10
11
pptli] = EXPR1;
12
13
14
// Sorts tasks in decreasing order of ppt
15
allTasks.sort(Comparator.comparing((Integer t)->ppt[t]).reversed());
16
double timeRemaining = timelimit;
17
18
for (int task : allTasks) {
19
if (EXPR2) {
20
retTasks.add(task);
21
timeRemaining -- time[task];
22
23
24
return retTasks;
25
Recall that there are N tasks in total (that is, points and time both have length N). What is
the big O runtime complexity of the greedy method in terms of N? Briefly explain your
answer referencing the code.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe0c1da23-8385-43a4-ba17-7f8fdcca0d75%2Fad4f3e49-2865-47ac-a28b-8883c6048400%2Fnk0ykc_processed.png&w=3840&q=75)
Transcribed Image Text:public List<Integer> greedy(double[] points, double[] time, double timelimit) {
6.
ArrayList<Integer> retTasks = new ArrayList<>();
ArrayList<Integer> allTasks = new ArrayList<>();
double[] ppt = new double[points.length];
for (int i=0; i< points.length; i++) {
allTasks.add(i);
9.
10
11
pptli] = EXPR1;
12
13
14
// Sorts tasks in decreasing order of ppt
15
allTasks.sort(Comparator.comparing((Integer t)->ppt[t]).reversed());
16
double timeRemaining = timelimit;
17
18
for (int task : allTasks) {
19
if (EXPR2) {
20
retTasks.add(task);
21
timeRemaining -- time[task];
22
23
24
return retTasks;
25
Recall that there are N tasks in total (that is, points and time both have length N). What is
the big O runtime complexity of the greedy method in terms of N? Briefly explain your
answer referencing the code.
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
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY