Комментарии:
Romba thanks akka🙂
ОтветитьHow to do Armstrong number using recurssion
ОтветитьLoop kum recursion kum yena different mam..
ОтветитьIf k=0 na aathu 0 va return pannama eppdi if kulla iriuka 55 ahh return pannuthu
Actually la statement false aachuna else kulla iriuku return 0 va dhanna return pannanum
One small doubt mam output la enter your no.ketu athuku etha mari factorial koduka epudi
Ответитьakka romba thanks for explaining this tough topic
ОтветитьVery useful madam thank you so much..
ОтветитьMadam Fibonacci program kku
output:1
1,1,2,3,5,8.... Ippadi varanumaa?
Output:2
Illana adhai ellaam add panni total print pannanumaa?
Eg: 1+1+2+3+5+8.... Sollunga madam
Good explanation ka
ОтветитьMaam n = 5 apdinu startingla varumbothu
5*factorial (5-1);
Next call pannum bothu N value update ayuratha like 4*factorial (4-1)
Athu yepadi store pannuthu 5*4*factorial(4-1)
best explanation i've seen in this topic so far.
Ответитьnice explanation.. thank u.....you deserve more subscribers... keep uploading more videos especially on data structures and alogorithms...
Ответитьvery good teaching
ОтветитьAkka loop la panra ellamea recursion la panalama
ОтветитьMam super 👍..
Java programming lla all notes madom Google drive lla tha ga ..
great explanation thank you mam
Ответитьநன்றிகள் அக்கா
ОтветитьThank you mam..
Ответить