Informatics2-2021/Lab11
Tartalomjegyzék |
Exercises
Deep Sum
Write a recursive function whose input is a list containing lists up to any depth containing positive integers. The function must return the sum of all numbers inside the list.
Example:
[1, 2, 3, [4, 5], [[[6], 7]]] -> 28
Palindrome
Write a recursive function which checks whether a given string is a palindrome or not. Then try to write a non recursive function for that and compare the time complexity.
Example:
aba -> True abb -> False
Factorial
Write a recursive function to compute the factorial of a given natural number. Then try to write a non recursive function for that and compare their time complexity.
Sum Digit
Write a recursive function to compute the sum of the digits of a given positive integers.
Example:
234-->9
Sum Series
Write a recursive function to compute sum of the nonnegative series n+(n-2)+... for a given input n.
Power
Write a recursive function to compute a power of a number without using **. Example:
power(2,4)-->16
