Afrikaans
Akan
Albanian
Amharic
Arabic
Armenian
Azerbaijani
Basque
Belarusian
Bemba
Bengali
Bihari
Bosnian
Breton
Bulgarian
Cambodian
Catalan
Cebuano
Cherokee
Chichewa
Chinese (Simplified)
Chinese (Traditional)
Corsican
Croatian
Czech
Danish
Dutch
English
Esperanto
Estonian
Ewe
Faroese
Filipino
Finnish
French
Frisian
Ga
Galician
Georgian
German
Greek
Guarani
Gujarati
Haitian Creole
Hausa
Hawaiian
Hebrew
Hindi
Hmong
Icelandic
Igbo
Indonesian
Interlingua
Irish
Italian
Japanese
Javanese
Kannada
Kazakh
Kinyarwanda
Kirundi
Kongo
Korean
Krio (Sierra Leone)
Kurdish
Kurdish (Soranî)
Kyrgyz
Laothian
Latin
Latvian
Lingala
Lithuanian
Lozi
Luganda
Luo
Luxembourgish
Macedonian
Malagasy
Malay
Malayalam
Maltese
Maori
Marathi
Mauritian Creole
Moldavian
Mongolian
Myanmar (Burmese)
Montenegrin
Nepali
Nigerian Pidgin
Northern Sotho
Norwegian
Norwegian (Nynorsk)
Occitan
Oriya
Oromo
Pashto
Persian
Polish
Portuguese (Brazil)
Portuguese (Portugal)
Punjabi
Quechua
Romanian
Romansh
Runyakitara
Russian
Samoan
Scots Gaelic
Serbian
Serbo-Croatian
Sesotho
Setswana
Seychellois Creole
Shona
Sindhi
Sinhalese
Slovak
Slovenian
Somali
Spanish
Spanish (Latin American)
Sundanese
Swahili
Swedish
Tajik
Tamil
Tatar
Telugu
Thai
Tigrinya
Tonga
Tshiluba
Tumbuka
Turkish
Turkmen
Twi
Uighur
Ukrainian
Urdu
Uzbek
Vietnamese
Welsh
Wolof
Xhosa
Yiddish
Yoruba
Zulu
OK, so now let's take a look at the solution and try to figure out what happens here.
And basically, why does it happen this way?
So we know if we want to print a sequence?
Some size of, I don't know, integers or characters or a double value, so it doesn't really matter.
So we are going to use the print operation right?
We are going to print the values to the screen.
Then we are probably going to make some recursive function call.
All right.
Once we do the recursive function call, then basically every time we will reduce the sequence by one
and still keep on printing out right after we are done printing the sequence, the first part of the
sequence, then we move on to printing out the second part of the sequence.
Once we are going back from our recursion, we print the next part of the sequence.
So we, for example, first of all, we print out in this case, let's say B-BBEE.
Then once we are done with the recursive calls, then on our way back where we stopped in the calling
to the function itself, we print the.
And the only difference here, when we use a sequence of, let's say, two times more multiplied by
the startle right, so for example, first of all, we wanted to see we in previous exercise.
I think we solved something like this just with integers.
So BDD, there was no problem.
We simply used the printing operation, then the recursive function called then the printing operation
again.
But now, since we know that the sequence should be two times more, then the answer is very, very
clean and very, very elegant.
We simply use this one, this one, this one.
We simply use two times printing out this second character, so we print out through the screen.
The second character a two times for every time we go back in the recursion, as opposed to printing
just once before we make the recursion function call.
OK, so that's the difference.
If you will run this program right now, you will see that it works exactly as you expect it to.
OK.
And I think that here is nothing so complicated in this solution, so you can try it on your own.
You can run this program and make sure that everything works exactly as you expect.
OK.
So thank you guys for watching.
Keep on practicing, and I'll see you in the next videos.
Bye bye, bye.
Bye Bye.
Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.