Posts

Showing posts from March, 2022

Palindrome String using Recursion (Easy method)

 def palindrome(s,n,r):     if n==0:         return r      else:         r+=s[n-1]         return palindrome(s,n-1,r) s="malayalam" n=len(s) r='' res=palindrome(s,n,r) if s==res:     print(res,"is palindrome string") else:     print(res,"is not palindrome string")

Palindrome number using recursion

  def palindrome(n,r):     if n==0:         return r     else:         r=n%10+r*10         return palindrome(n//10,r) n=1001 r=0 res=palindrome(n,r) if n==res:     print(res,"is palindrome") else:     print(res,"is not palindrome")

print all prime number from 1 to 100

  for n in range(2,101):     t=0     for i in range(2,n):         if n%i==0:             t=1             break     if t==0:         print(n,end=" ")

Fibonacci series in python using function

 def fib(n):     if n==0:         return 0     elif n==1:         return 1      else:         return fib(n-1) + fib(n-2) n=int(input()) for i in range(n):     print(fib(i),end=" ")

Fibonacci Series in python

a=0 b=1 print(a,b,end=" ") for i in range(10):     c=a+b      a=b      b=c     print(c,end=" ")