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
All right.
So I got a good question for you.
I've modified a little bit.
Some of the questions that probably you already solved by now and created this new version of this new
question.
OK, so what do you have to do now is to develop a recursive function that receives two values.
The first one is an integer called total.
Probably it will be of an integer type, and the name of the variable is going to be total of the first
parameter.
And then also you get a character.
The name of this variable should be vowel.
OK.
Just value.
And this character should represent a lowercase character.
OK, so from lowercase a.
Lowercase A. Up to lowercase z.
OK, so two things this function should receive.
And one, the function should do, the function should print a sequence of total lowercase values.
OK, and then a sequence of total uppercase values.
So that means, for example, you received a total equal to three and also you received voucher equal
to lowercase C.
We will assume that the voucher will already be lowercase.
No need to check this out.
We will assume that whoever calls this function knows that the first parameter should be of a lowercase
type.
OK, so we call this function with total equals to three value equal to lower Casey, and the printed
result should be CCC lowercase and then CCC upper cases.
OK, and for another example, you have a total equals two val equals 2B, so you will get two lowercase
b's and then two uppercase B.
OK.
So that's basically what should be printed.
That's from, we think, another example.
Don't don't to put your attention here.
OK, so this is it.
This is exactly what we are going to do.
OK.
I'll also already prepared the solution for us.
So start by thinking out for a couple of things.
What should be the function type?
What it should receive?
What should be its name?
Then start thinking about what should be the recursive call.
How many times some printing operation should occur?
What should be also the stopping condition?
And also, last thing that you need to think about in this video is how you can take a lowercase character
in represented as a hire, as an uppercase character.
OK, so that's these are basically the things that you need to consider when writing down these function
in solving this exercise.
So, guys, good luck.
We'll see together in the solution.
Try it on your own.
Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.