CodeWorkout
  1. Home
  2. Gym
  3. Review 1
  4. X489: Recursion - Recursive Binary Search

X489: Recursion - Recursive Binary Search

Write an algorithm that takes an ArrayList and uses a recursive binary search to return both the index of a given String, or -1 if the String does not exist in the ArrayList. Then, have it also return the number of recursions needed to search. The two numbers should be returned as a String in the format " ". Input ArrayLists are already sorted in alphabetical order. NEEDS TESTING, TEST CASE FINALIZING, FEEDBACK OVERWRITING

Your Answer:

Reset
Next exercise

Feedback

Your feedback will appear here when you check your answer.