Recursive shelves: Threshold file
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
sectionSums. Start with the wholereadingslist as a section. Record the sum of that section. If it has more than one number, split it into a left half and a right half. Use the same steps on the left half first, then on the right half. When a section has an odd length, the left half has one fewer number. A section with one number is not split. Do not record empty sections.sectionSumscontains the sums in the order you record them. - Count the numbers in
sectionSumsthat are at leastk(greater than or equal tok). Store the count inatLeastK. - Complete
recursiveShelvesThresholdFileso it returnsatLeastK. Return it, do not print it.
Example
If readings is [5, 0, 10, 5, -7] and k is 3, then sectionSums is [13, 5, 5, 0, 8, 10, -2, 5, -7] and recursiveShelvesThresholdFile returns 6.
Rules
- If
sectionSumsis empty, the count is 0. k(a whole number from 1 to 8) is the threshold in task 2: compare each number with it.
Test data
TEST DATA 1: readings is [19, 7, -11, 7, 0] and k is 1.
TEST DATA 2: readings is [-5, 8, 8, 8] and k is 5.
Examples
Input: readings = [19,7,-11,7,0] k = 1 Output: 6
sectionSums is [22, 26, 19, 7, -4, -11, 7, 7, 0]. Here k is 1. The numbers at least 1 are [22, 26, 19, 7, 7, 7]. There are 6, so return 6.
Input: readings = [-5,8,8,8] k = 5 Output: 5
sectionSums is [19, 3, -5, 8, 16, 8, 8]. Here k is 5. The numbers at least 5 are [19, 8, 16, 8, 8]. There are 5, so return 5.
Input: readings = [] k = 2 Output: 0
sectionSums is []. Here k is 2. The numbers at least 2 are []. There are 0, so return 0.
Input limits
- 0 <= input size <= 64.
- k is a whole number from 1 to 8. 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 sectionSums 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.