Q&A Discussions
Is it still recursion?
1 Vote
3 Answers
an indentation error
0 Votes
2 Answers
Recursive Fibonacci slow?
12 Votes
4 Answers
Two pairs and two GCD
1 Vote
1 Answer
Attention please
0 Votes
5 Answers
i want to get a number and find all of that's primefactor and multiple the next primefactors with each other.only with recursion
0 Votes
1 Answer
why the answer of this code is 321123? this is the explain attatched with the answer. but i could not understand it
1 Vote
5 Answers
What is an exit condition?
0 Votes
2 Answers
Can anyone explain me what is the use of return ??? What is the difference between return 0 return 1 return 4*factor(n-1)
0 Votes
2 Answers
Convert Positive integer number into roman number for 16bit IDE using int data type.
9 Votes
1 Answer
Repeating charachters
6 Votes
5 Answers
I am solving Daily Codin Problem #7 with Python [Recurssion] Can anyone explain this code?
2 Votes
3 Answers
i need help in memoizing PLS
0 Votes
1 Answer
Print of Prime numbers
0 Votes
1 Answer
def my_func(n,i,c):
if i==0:
if c==2:
return True
else:
return False
if n%i==0:
c=c+1
return n,i-1,c
n=int(input())
ans=my_func(n,n,0)
if ans==True:
print ("prime")
else:
print('not prime')
0 Votes
1 Answer
Help plis.
1 Vote
1 Answer
Dont u think guys, one if the program showing an output of "True False" in the chapter of recursion is wrong? Well i think so.
-1 Vote
2 Answers
Explanattion.
0 Votes
1 Answer
Hot today
New code
1 Votes
How would you solve the part of the C# Intermediate code project that requires operator overloading?
0 Votes
Hello Everyone
0 Votes