A recursive algorithm is an algorithm which calls itself with the subset of values. Most computer programming languages support recursion by allowing a function to call itself within the program text. For example, the factorial function can be defined recursively by the equations 0! = 1 and, for all n > 0, n! = n(n ? 1)!. |

189 Towers of Hanoi | Tower Of Hanoi is a mathematical game. It uses three rods and disks with the different size (small, medium and big). The objective of the game is to move the entire stack of disks to another rod. It should follow (1) Only one disk can be moved at a time. (2) Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack (3) No disk may be placed on top of a smaller disk. | |

190 Count the number of elements in a list | Write a program to count the number of elements in the linked list. | |

191 Linear search | Linear search is a method to find particular item in an array. It start to check each item and compare with search item until it finds. The linear search performs nonsorted items in array. | |

192 Binary Search | Binary search is a method to find a particular item in the sorted array. In each step, the algorithm divides the array equally and match the middle item. If the key match, return the index. If the key is less then middle, search left subarray. Else search right subarray. | |

193 All possible combinations | Write a program to print all the possible combination of given string. | |

194 Palindrome | A palindromic number is a number that remains the same when its digits are reversed. | |

195 Binomial Coefficient | Binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. |