recursion in this triangular numbers factorials anagrams recursion is programming technique in which method (functioncalls itself this may sound like strange thing to door even catastrophic mistake recursion ishoweverone of the most interestingand one of the most surprisingly effectivetechniques in programming like pulling yourself up by your bootstraps (you do have bootstrapsdon' you?)recursion seems incredible when you first encounter it howeverit not only worksit also provides unique conceptual framework for solving many problems in this we'll examine numerous examples to show the wide variety of situations to which recursion can be applied we will calculate triangular numbers and factorialsgenerate anagramsperform recursive binary searchsolve the towers of hanoi puzzleand investigate sorting technique called mergesort workshop applets are provided to demonstrate the towers of hanoi and mergesort we'll also discuss the strengths and weaknesses of recursionand show how recursive approach can be transformed into stack-based approach triangular numbers it' said that the pythagoriansa band of mathematicians in ancient greece who worked under pythagoras (of pythagorian theorem fame)felt mystical connection with the series of numbers (where the means the series continues indefinitelycan you find the next member of this seriesthe nth term in the series is obtained by adding to the previous term thusthe second term is found by adding to the first term (which is )giving the third term is added to the second term (which is giving and so on recursive binary search the towers of hanoi mergesort eliminating recursion some interesting recursive applications