Informatics2-2021/Lab11

A MathWikiből
(Változatok közti eltérés)
(Factorial)
(Sum Digit)
21. sor: 21. sor:
  
 
===Sum Digit===
 
===Sum Digit===
 +
Write a recursive function to compute the sum of the digits of a given positive integers.
 +
 +
Example:
 +
234-->9
  
 
===Sum Series===
 
===Sum Series===

A lap 2021. április 27., 14:43-kori változata


Tartalomjegyzék

Exercises

Dynamic programming

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

Power

Target

Finite State Machine

Parenthesis

Given a string, replace the enclosed parts of the string with a $ character. A formula is enclosed if it is surrounded by parenthesis. For example:

(xc)aa(c(b)) -> $$$$aa$$$$$$
Személyes eszközök