edited by
633 views
0 votes
0 votes

Which of the following algorithms CANNOT be designed without recursion?

  1. Tower of Hanoi
  2. Fibonacci Series
  3. Tree Traversal
  4. None of the above
edited by

1 Answer

Best answer
1 votes
1 votes
Every problem which can be solved using recursion can also be solved using iterations.
selected by
Answer:

Related questions

0 votes
0 votes
1 answer
1
Bikram asked May 26, 2017
465 views
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15...
2 votes
2 votes
2 answers
3
Bikram asked May 26, 2017
343 views
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest pat...
1 votes
1 votes
2 answers
4
Bikram asked May 26, 2017
456 views
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.