TechBugged

Example: For a given K find:                                         1 + 1/2 + 1/4 + 1/8 + ... + 1/(2^k) 

Example:                Input: 1234                Output: 10

This program is to multiply two numbers using Recursive function.

This program is to check whether a string is pallindrome or not using Recursion in C++. Example: Input: "malayalam"                 Output: Yes

This program will show you How to count number of zeroes in a given integer using Recursion. Example:    Input:10208                     Output: 2

In this program we'll learn How to convert a string into into corresponding integer value. Example: To convert string "1234" to its integer value 1234. #include <iostream> #include<string.h> #include<math.h>