4. how many numbers are negative inside a list of integers. The work unit for this algorithm is the addition on the counter. The analysis has to be done for: A. Best-case B. Worst-case C. Average-case function count_neg_numbers(List L, size n) integer i; end function counter = 0; for i=1 to n do if L[i]<0 then counter = counter + 1; end if end for Provide the analysis of complexity for this algorithm that counts print(counter); //i is a variable containing the current position in the list //counter is a variable used to count how many elements are negative in the list (initially O //for loop to scroll the list moving across all the positions from 1 to n //if an element in the list is negative //increase the counter //print the counter of negative elements found in the list
4. how many numbers are negative inside a list of integers. The work unit for this algorithm is the addition on the counter. The analysis has to be done for: A. Best-case B. Worst-case C. Average-case function count_neg_numbers(List L, size n) integer i; end function counter = 0; for i=1 to n do if L[i]<0 then counter = counter + 1; end if end for Provide the analysis of complexity for this algorithm that counts print(counter); //i is a variable containing the current position in the list //counter is a variable used to count how many elements are negative in the list (initially O //for loop to scroll the list moving across all the positions from 1 to n //if an element in the list is negative //increase the counter //print the counter of negative elements found in the list
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
Need help with discrete structures class
![4.
how many numbers are negative inside a list of integers.
The work unit for this algorithm is the addition on the counter.
The analysis has to be done for:
A. Best-case
B. Worst-case
C. Average-case
function count_neg_numbers(List L, size n)
integer i;
counter = 0;
for i=1 to n do
if L[i]<0 then
end function
counter = counter + 1;
Provide the analysis of complexity for this algorithm that counts
end if
end for
print(counter);
//i is a variable containing the current position in the list
//counter is a variable used to count how many elements are negative in the list (initially 0)
//for loop to scroll the list moving across all the positions from 1 to n
//if an element in the list is negative
//increase the counter
//print the counter of negative elements found in the list](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdaad9e7e-1f14-44d5-98ac-51623b651f9b%2F59697b26-390c-44ac-bee7-76b2781f2106%2Fajatbb_processed.jpeg&w=3840&q=75)
Transcribed Image Text:4.
how many numbers are negative inside a list of integers.
The work unit for this algorithm is the addition on the counter.
The analysis has to be done for:
A. Best-case
B. Worst-case
C. Average-case
function count_neg_numbers(List L, size n)
integer i;
counter = 0;
for i=1 to n do
if L[i]<0 then
end function
counter = counter + 1;
Provide the analysis of complexity for this algorithm that counts
end if
end for
print(counter);
//i is a variable containing the current position in the list
//counter is a variable used to count how many elements are negative in the list (initially 0)
//for loop to scroll the list moving across all the positions from 1 to n
//if an element in the list is negative
//increase the counter
//print the counter of negative elements found in the list
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 3 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