Multiple choice technology architecture

An algorithm that calls itself directly or indirectly is known as

  1. Sub algorithm

  2. Recursion

  3. Polish notation

  4. Traversal algorithm
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Recursion is when an algorithm calls itself directly or indirectly to solve a problem by breaking it down into smaller instances of the same problem. Option A is not a standard term. Option C is a notation for writing expressions. Option D is a type of algorithm for visiting nodes in a data structure, not a general concept.

Keep practicing — related questions