Recursion

AP Computer Science A· difficulty 4/5

Recursive solutions:

  • A

    Use less memory

  • B

    Always faster

  • C

    Often clearer for tree-shaped problems; can be slower or use more memory

    check_circle
  • D

    Cannot solve loop problems

Explanation

Tree problems (e.g., traversals, divide-and-conquer) are natural in recursion.

Want 10 more like this — adaptive to your weak spots?

Related questions