2. Explain when we can have the best case and when we can have the worst case. Give the complexity of your algorithm in each case. ● Best case: Question 1: 0 Worst case: Given an array, that can contain zeros, positive and negative elements. 1. Write an algorithm that calculates the number of positive elements (>0), the number of negative elements, and the number of zeros. Example: ● -5 Number of positive elements: 2 Number of negative elements: 3 Number of zeros: 3 Algorithm: wwwmmm -7 0 -6 8 0
2. Explain when we can have the best case and when we can have the worst case. Give the complexity of your algorithm in each case. ● Best case: Question 1: 0 Worst case: Given an array, that can contain zeros, positive and negative elements. 1. Write an algorithm that calculates the number of positive elements (>0), the number of negative elements, and the number of zeros. Example: ● -5 Number of positive elements: 2 Number of negative elements: 3 Number of zeros: 3 Algorithm: wwwmmm -7 0 -6 8 0
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
do not plagiarise

Transcribed Image Text:2. Explain when we can have the best case and when we can have the worst case. Give
the complexity of your algorithm in each case.
Best case:
0
Worst case:
Question 1:
Given an array, that can contain zeros, positive and negative elements.
1. Write an algorithm that calculates the number of positive elements (>0), the number
of negative elements, and the number of zeros.
Example:
1
Algorithm:
-5
Number of positive elements: 2
Number of negative elements: 3
Number of zeros: 3
-7
0
-6
8
0
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 5 steps with 3 images

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