Question

An algorithm bthwt calls itself directly is known as

Answer 1

An algorithm that calls itself directly is known as Recursion.

Answer 2

An algorithm that calls itself directly is known as recursion.

What is Recursion?

Recursion is the process of a function calling itself directly or indirectly, and the associated function is known as a recursive function. Certain problems can be solved quickly using the recursive algorithm. Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, and others are examples of such issues.