The last topic of the course closes the thread opened in 1.10: a call whose result is discarded does nothing. In recursion that mistake is deadly, because the answer is built entirely out of returned values. Writing helper(...) on a line by itself instead of return helper(...) compiles, terminates, and answers wrongly every time.
What you are given
The driver builds a SORTED int array and passes it to your methods. Write a class named RecSearch. Do not write a main method.
The question
(a) public static int find(int[] data, int target, int low, int high) searches recursively between low and high inclusive and returns an index holding target, or -1.
(b) public static int find(int[] data, int target) starts that search across the whole array.
(c) public static int maxFrom(int[] data, int i) returns the largest value at or after index i, recursively. Assume i is a valid index.
(d) public static int countFrom(int[] data, int target, int i) returns how many elements at or after i equal target, recursively.
What the reader is looking for
Write class RecSearch with the four methods described. No main method.
Every recursive call's result must be RETURNED or combined into the answer. Calling and discarding compiles and answers wrongly.
Part (a) returns -1 when low passes high, which is what makes the search end when the target is absent.
Worked examples
These show what a correct answer prints. There are more cases you cannot see, and they use different values, so an answer built around just these numbers will fail.
Example 1 input
7
1 3 5 7 9 11 13
11
Example 1 output
true
true
13
1
Example 2 input
6
2 4 4 4 8 10
4
Example 2 output
true
true
10
3
Your answer
Main.java
Input for the Run button
How this is scored: your answer runs against every test case, and the fraction it passes becomes your score out of 4. That is not how a human AP reader marks a rubric, so treat the score as a check on whether your code works, and the rubric above as the thing you are actually practising.
Stuck?
Hint 1
Two methods with the same name and different parameter lists are overloads, and the short one exists only to supply the starting bounds to the long one.
Hint 2
Part (c) and part (d) both compute the answer for the REST of the array first, then fold the current element into it. That returned value is the whole answer.
Hint 3
The driver prints whether the search succeeded rather than the index, because on repeated values a correct recursive search may land on any of them.
Before you submit
4 mistake(s) that lose points on this question
Each of these is a real error the grader catches. Check your answer against them before you submit, not instead of trying.
part (d) discards the recursive result, the thread opened back in 1.10
part (c) discards the recursive result and returns the current element
part (a) recurses into the wrong half
part (b) searches only the first half of the array
Whether you're a student, parent, or teacher — I'd love to hear from you.
Just want free AP CS resources?
Enter your email below and check the subscribe box — no message needed.
Students get daily practice questions and study tips. Teachers get curriculum resources and teaching strategies.
Typically responds within 24 hours
✓
Message Sent!
Thanks for reaching out. I'll get back to you within 24 hours.
34.8% of Tanner’s CSP students score 5s. The national average is 9.6%.
I’m a Student
I’m a Teacher
✓Free AP CSP Big Ideas cheat sheet (PDF)
✓Daily practice questions covering all 5 Big Ideas
✓Create Task tips that actually work — from a real AP teacher
✓Free class codes with student progress tracking
✓3 full practice exams + Top 100 questions for your class
✓Create Task guidance and pseudocode reference sheets
Which AP CS exams are you prepping for?
✓
You’re in!
Your Big Ideas cheat sheet is on its way.
No thanks, I’ll figure it out myself
Avg student improvement: 2+ score levels | Real AP teacher, not just a tutor
AP Cybersecurity — National Launch 2026–27
Get Early Access to AP Cyber
AP Cyber launches nationally fall 2026. Get in early to help shape the course — start free with Unit 1 and the free teacher gradebook.
✓
You’re in — you’re on the AP Cyber early-access list!
Tanner will follow up personally within 48 hours. Your feedback will directly shape what gets built.
Step 1 of 4
Early Access — Limited Spots
Who are you?
Are you a teacher or a student?
I’m a Teacher
I’m a Student
Free to start — Unit 1 and the teacher gradebook are always free, no credit card.
Founding teachers unlock all 5 units and get direct input on what we build.
Not interested right now
Step 2 of 4
Your School
Tell us about your class
Other AP CS courses you teach
Your Situation
Tell us about yourself
Step 3 of 4
Classroom Needs
What does your classroom need? (select all that apply)
How You Study
What would help you most? (select all that apply)
Step 4 of 4
Almost Done
Where should we send your early-access details?
Free gradebook + Unit 1 | Your feedback shapes the course | Built by a real AP teacher