Define a function named sumPositives that when passed an integer array, returns the sum of the positive numbers in the array. Return O if the array is null. For example: Test System.out.println (sumPositives (null)); System.out.println (sumPositives (new int[] {})); System.out.println (sumPositives (new int[]{10, 70, 20, 90))); System.out.println (sumPositives (new int[]{1, 7, 2, 9})); int[] data = new int [10000]; for(int i=0; i < data.length; i++) { data[i] = 2; } data [data. length 1] = -101; System.out.println (sumPositives (data)); Input null Result 0 empty array (10, 70, 20, 90} 1, 7, 2, 9 10000 items, all items being 2 except last being -101 19998 0 190 19

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
icon
Related questions
Question
Define a function named sumPositives that when passed an integer array, returns the sum of the positive numbers in the array. Return O if the array is null.
For example:
Test
System.out.println (sumPositives (null));
System.out.println (sumPositives (new int[] {}));
System.out.println (sumPositives (new int[]{10, 70, 20, 90)));
System.out.println (sumPositives (new int[]{1, 7, 2, 9}));
int[] data = new int [10000];
for(int i=0; i < data.length; i++) {
data[i] = 2;
}
data [data. length
1] = -101;
System.out.println (sumPositives (data));
Input
null
Result
0
empty array
(10, 70, 20, 90}
1, 7, 2, 9
10000 items, all items being 2 except last being -101 19998
0
190
19
Transcribed Image Text:Define a function named sumPositives that when passed an integer array, returns the sum of the positive numbers in the array. Return O if the array is null. For example: Test System.out.println (sumPositives (null)); System.out.println (sumPositives (new int[] {})); System.out.println (sumPositives (new int[]{10, 70, 20, 90))); System.out.println (sumPositives (new int[]{1, 7, 2, 9})); int[] data = new int [10000]; for(int i=0; i < data.length; i++) { data[i] = 2; } data [data. length 1] = -101; System.out.println (sumPositives (data)); Input null Result 0 empty array (10, 70, 20, 90} 1, 7, 2, 9 10000 items, all items being 2 except last being -101 19998 0 190 19
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Arrays
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education