Sorting press: Positive-ink invoice
Stuck or curious how this works? Visualize Binary Search ↗
Inputs
readings is a list of integers (numbers with no decimal part). It may be empty, and numbers may repeat unless task 1 says otherwise.
Your tasks
- Create a list
sorted. Sortreadingsfrom smallest to largest using merge sort. To use merge sort, split the list into smaller parts, sort those parts, then join the sorted parts in order. Keep all repeated numbers.sortedis the sorted list. - Add only the numbers in
sortedthat are greater than 0. Store the sum inpositiveTotal. - Complete
sortingPressPositiveInkInvoiceso it returnspositiveTotal. Return it, do not print it.
Example
If readings is [-5, 5, 4, 5, 7], then sorted is [-5, 4, 5, 5, 7] and sortingPressPositiveInkInvoice returns 21.
Rules
- Skip 0 and negative numbers.
- If no number is greater than 0, return 0.
Test data
TEST DATA 1: readings is [2, 2, 0, 9, -3].
TEST DATA 2: readings is [-5, 8, 8, 8].
Examples
Input: readings = [2,2,0,9,-3] Output: 13
sorted is [-3, 0, 2, 2, 9]. Keep [2, 2, 9] and add those numbers. Return 13.
Input: readings = [-5,8,8,8] Output: 24
sorted is [-5, 8, 8, 8]. Keep [8, 8, 8] and add those numbers. Return 24.
Input: readings = [] Output: 0
sorted is []. Keep [] and add those numbers. Return 0.
Input limits
- 0 <= input size <= 64.
- Answers fit in a signed 32-bit integer: -2,147,483,648 through 2,147,483,647.
- Input numbers have no decimal part. They range from -1,000,000 to 1,000,000. Follow any extra input rules in task 1.
Efficiency goal
Big-O describes how the work or memory needed grows as the input gets larger.
Efficiency goal: time O(n log n); extra memory, including the helper list, O(n). n is the input length. These labels describe how work and memory grow with the input.
Practice focus
Build sorted first, then return exactly what the tasks ask for. Follow the order, keep repeated values when the rule says so, and check the empty case.