All language subtitles for 9. Printing1ToN and NTo1 - Question

af Afrikaans
ak Akan
sq Albanian
am Amharic
ar Arabic
hy Armenian
az Azerbaijani
eu Basque
be Belarusian
bem Bemba
bn Bengali
bh Bihari
bs Bosnian
br Breton
bg Bulgarian
km Cambodian
ca Catalan
ceb Cebuano
chr Cherokee
ny Chichewa
zh-CN Chinese (Simplified)
zh-TW Chinese (Traditional)
co Corsican
hr Croatian
cs Czech
da Danish
nl Dutch
en English
eo Esperanto
et Estonian
ee Ewe
fo Faroese
tl Filipino
fi Finnish
fr French
fy Frisian
gaa Ga
gl Galician
ka Georgian
de German
el Greek
gn Guarani
gu Gujarati
ht Haitian Creole
ha Hausa
haw Hawaiian
iw Hebrew
hi Hindi
hmn Hmong
is Icelandic
ig Igbo
id Indonesian
ia Interlingua
ga Irish
it Italian
ja Japanese
jw Javanese
kn Kannada
kk Kazakh
rw Kinyarwanda
rn Kirundi
kg Kongo
ko Korean
kri Krio (Sierra Leone)
ku Kurdish
ckb Kurdish (Soranรฎ)
ky Kyrgyz
lo Laothian
la Latin
lv Latvian
ln Lingala
lt Lithuanian
loz Lozi
lg Luganda
ach Luo
lb Luxembourgish
mk Macedonian
mg Malagasy
ms Malay
ml Malayalam
mt Maltese
mi Maori
mr Marathi
mfe Mauritian Creole
mo Moldavian
mn Mongolian
my Myanmar (Burmese)
sr-ME Montenegrin
ne Nepali
pcm Nigerian Pidgin
nso Northern Sotho
no Norwegian
nn Norwegian (Nynorsk)
oc Occitan
or Oriya
om Oromo
ps Pashto
fa Persian
pl Polish
pt-BR Portuguese (Brazil)
pt Portuguese (Portugal)
pa Punjabi
qu Quechua
ro Romanian
rm Romansh
nyn Runyakitara
ru Russian
sm Samoan
gd Scots Gaelic
sr Serbian
sh Serbo-Croatian
st Sesotho
tn Setswana
crs Seychellois Creole
sn Shona
sd Sindhi
si Sinhalese
sk Slovak
sl Slovenian
so Somali
es Spanish
es-419 Spanish (Latin American)
su Sundanese
sw Swahili
sv Swedish
tg Tajik
ta Tamil
tt Tatar
te Telugu
th Thai
ti Tigrinya
to Tonga
lua Tshiluba
tum Tumbuka
tr Turkish
tk Turkmen
tw Twi
ug Uighur
uk Ukrainian
ur Urdu
uz Uzbek
vi Vietnamese
cy Welsh
wo Wolof
xh Xhosa
yi Yiddish
yo Yoruba
zu Zulu

Original subtitles

Welcome back, ladies, ladies and gentlemen, to this amazing exercise in our recursive functions and

now what we are going to do is basically what are we going to do is to write a recursive recursive function.

That's basically what he's going to do, is that it's right, rather recursive function that will receive

some no say in.

All right.

And this function is going to receive some number and and what it will do is just to print this function,

will print all the numbers from one from one up from one four one up to this and up to end.

OK, so that's basically all these function will have to do.

So for example, for example, if we know the function receives, I don't know for them in this case.

OK, so let's say input use four.

And in this case, what's going to be printed to the screen is just something like this.

One, two, three, four.

OK, seems to be pretty, pretty easy.

But does it I mean, is it really easy or basically you have to think about it more in depth because

you probably know that you could do so simply by running some for a loop.

And to use like for I equals to one as long as I is less than or equal to this and and just print the

result.

So basically you could go with just these solutions.

Let's say that's the body of the function.

So for let's say I equals to one as long as I is less than or equal to and I plus plus and then basically

to print half just percentage and specify here I write.

So that's basically the most trivial way to solve this exercise.

But of course that's not the case because we are using here a recursive function in not an iterative

approach with using these for a loop.

So think about the solution.

Think about where you're going to place the print line and where you were going also to do the recursive

call.

And how will you also specify the stopping or basically the base condition.

So good luck, guys.

And once you're done, I will see you in the Solutions video.

Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.