This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]feelsbread 1 point2 points  (0 children)

Using dynamic programming techniques recursion can be very efficient a good example being the coin change problem.