Scribd
Upload
10 views1 page

Programming Questions Recursions 4.9.25

The document lists various recursive programming tasks that include finding sums, generating sequences, checking primality, and manipulating strings and arrays. It covers fundamental algorithms such as Fibonacci series, factorial calculation, and binary search. Additionally, it addresses operations on linked lists and the Hailstone sequence.

Uploaded by

953622104069
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views1 page

Programming Questions Recursions 4.9.25

The document lists various recursive programming tasks that include finding sums, generating sequences, checking primality, and manipulating strings and arrays. It covers fundamental algorithms such as Fibonacci series, factorial calculation, and binary search. Additionally, it addresses operations on linked lists and the Hailstone sequence.

Uploaded by

953622104069
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Recursions

1. Find sum of digits of the given number


2. Print Fibonacci Series using recursion.
3. Reverse a number using recursion
4. Print Binary Equivalent of an Integer using Recursion.
5. Check whether a Number is Prime or Not using Recursion.
6. Find Sum of Natural Numbers using Recursion.
7. Calculate the Power using Recursion
8. Find Product of Two Numbers using Recursion
9. Find Nth Fibonacci Number using Recursion
10. Find the Factorial of a Number using Recursion
11. Find GCD of Two Numbers using Recursion
12. Find LCM of Two Numbers using Recursion
13. Find HCF using Recursion
14. Print the array elements using recursion.
15. Count the digits of a given number using recursion
16. Get the largest element of an array using recursion
17. Print even or odd numbers in a given range using recursion.
18. Check whether a given string is a palindrome or not using recursion
19. Find the Hailstone Sequence of a given number up to 1
20. (Hailstone Sequence: If the number is even, just divide it by 2 and if it is odd, then
multiply it by 3 and add 1 to it.

Ex: The hailstone sequence starting at 13


is:

13 40 20 10 5 16 8 4 2 1

21. Copy one string to another using recursion


22. Count and display the number of steps in the Hailstone sequence recursively
23. Check if the Hailstone sequence length is even or odd using recursion
24. Implement a binary search algorithm using recursion
25. Print numbers from 1 to n without the help of loops (Use Recursion)
26. Print N to 1 without loop. (Use Recursion)
27. You are given two non-empty linked lists representing two non-negative integers. The
digits are stored in reverse order, and each of their nodes contains a single digit. Add the
two numbers and return the sum as a linked list. You may assume the two numbers do not
contain any leading zero, except the number 0 itself.

You might also like