subtitlecat.com

All language subtitles for 25. Extra Recursion 3 - Print Seq. of LowerCase Chars + Seq. of UpperCase Chars - Q

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

Galician

Georgian

German

Greek

Guarani

Gujarati

Haitian Creole

Hausa

Hawaiian

Hebrew

Hindi

Hmong

Hungarian Download

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

Would you like to inspect the original subtitles? These are the user uploaded subtitles that are being translated: 1 00:00:00,600 --> 00:00:01,150 All right. 2 00:00:01,440 --> 00:00:04,080 So I got a good question for you. 3 00:00:04,260 --> 00:00:05,610 I've modified a little bit. 4 00:00:05,700 --> 00:00:12,840 Some of the questions that probably you already solved by now and created this new version of this new 5 00:00:12,840 --> 00:00:13,410 question. 6 00:00:13,830 --> 00:00:21,600 OK, so what do you have to do now is to develop a recursive function that receives two values. 7 00:00:22,050 --> 00:00:26,250 The first one is an integer called total. 8 00:00:26,850 --> 00:00:32,910 Probably it will be of an integer type, and the name of the variable is going to be total of the first 9 00:00:32,910 --> 00:00:33,630 parameter. 10 00:00:34,840 --> 00:00:36,630 And then also you get a character. 11 00:00:37,080 --> 00:00:39,870 The name of this variable should be vowel. 12 00:00:39,960 --> 00:00:40,440 OK. 13 00:00:40,530 --> 00:00:41,310 Just value. 14 00:00:42,570 --> 00:00:46,600 And this character should represent a lowercase character. 15 00:00:46,620 --> 00:00:49,020 OK, so from lowercase a. 16 00:00:51,010 --> 00:00:54,340 Lowercase A. Up to lowercase z. 17 00:00:55,650 --> 00:00:57,750 OK, so two things this function should receive. 18 00:00:58,560 --> 00:01:05,280 And one, the function should do, the function should print a sequence of total lowercase values. 19 00:01:05,730 --> 00:01:09,980 OK, and then a sequence of total uppercase values. 20 00:01:10,970 --> 00:01:18,350 So that means, for example, you received a total equal to three and also you received voucher equal 21 00:01:18,440 --> 00:01:20,270 to lowercase C. 22 00:01:20,540 --> 00:01:24,470 We will assume that the voucher will already be lowercase. 23 00:01:24,500 --> 00:01:25,700 No need to check this out. 24 00:01:25,700 --> 00:01:32,300 We will assume that whoever calls this function knows that the first parameter should be of a lowercase 25 00:01:32,300 --> 00:01:32,660 type. 26 00:01:32,850 --> 00:01:39,350 OK, so we call this function with total equals to three value equal to lower Casey, and the printed 27 00:01:39,350 --> 00:01:44,540 result should be CCC lowercase and then CCC upper cases. 28 00:01:45,320 --> 00:01:53,060 OK, and for another example, you have a total equals two val equals 2B, so you will get two lowercase 29 00:01:53,060 --> 00:01:56,040 b's and then two uppercase B. 30 00:01:56,090 --> 00:01:56,540 OK. 31 00:01:57,830 --> 00:01:59,480 So that's basically what should be printed. 32 00:01:59,730 --> 00:02:01,940 That's from, we think, another example. 33 00:02:02,420 --> 00:02:05,590 Don't don't to put your attention here. 34 00:02:05,600 --> 00:02:07,960 OK, so this is it. 35 00:02:07,970 --> 00:02:10,070 This is exactly what we are going to do. 36 00:02:10,100 --> 00:02:10,470 OK. 37 00:02:10,520 --> 00:02:13,970 I'll also already prepared the solution for us. 38 00:02:14,300 --> 00:02:17,990 So start by thinking out for a couple of things. 39 00:02:18,200 --> 00:02:19,640 What should be the function type? 40 00:02:19,760 --> 00:02:20,870 What it should receive? 41 00:02:21,050 --> 00:02:22,130 What should be its name? 42 00:02:23,090 --> 00:02:27,470 Then start thinking about what should be the recursive call. 43 00:02:27,530 --> 00:02:31,130 How many times some printing operation should occur? 44 00:02:31,580 --> 00:02:33,560 What should be also the stopping condition? 45 00:02:34,940 --> 00:02:42,650 And also, last thing that you need to think about in this video is how you can take a lowercase character 46 00:02:42,920 --> 00:02:46,670 in represented as a hire, as an uppercase character. 47 00:02:46,700 --> 00:02:53,060 OK, so that's these are basically the things that you need to consider when writing down these function 48 00:02:53,060 --> 00:02:54,740 in solving this exercise. 49 00:02:55,220 --> 00:02:56,840 So, guys, good luck. 50 00:02:58,740 --> 00:03:01,410 We'll see together in the solution. 51 00:03:01,530 --> 00:03:02,310 Try it on your own. 4267