Log inSign up

AP Computer Science a Flashcards: Recursive Searching And Sorting

Study Recursive Searching And Sorting in AP Computer Science a with focused flashcards that help you recognize the idea, recall the key rule, and apply it in practice-style prompts.

QUESTION

What is tail recursion?

Tap card or press Space to flip

ANSWER

A recursion where the recursive call is the last operation. Can be optimized by compilers into iterative loops to save stack space.

1 / 28

AP Computer Science a: Data Collections

You are hereRecursive Searching and Sorting28 cards

All flashcards

28 cards

What this deck covers

This deck focuses on Recursive Searching And Sorting, giving you a quick way to review the definitions, rules, and examples that matter most for AP Computer Science a.

How to use these flashcards

Work through these flashcards in short sessions. Try to answer each prompt before flipping the card, then revisit any cards you miss until the explanation feels automatic.

Practice questions

1 of 32Practice questions for this set
For the recursive binary search method below, what is the time complexity of the given recursive algorithm? 
public class Searcher {
    public static int binarySearch(int[] nums, int target, int low, int high) {
        if (low > high) {
            return -1;
        }
        int mid = (low + high) / 2;
        if (nums[mid] == target) {
            return mid;
        }
        if (target < nums[mid]) {
            return binarySearch(nums, target, low, mid - 1);
        } else {
            return binarySearch(nums, target, mid + 1, high);
        }
    }
}
Choose an answer

Keep your progress across every deck

Free account · cards you mark are saved to it