1 00:00:00,000 --> 00:00:05,860 >> [MUSIC PLAYING] 2 00:00:05,860 --> 00:00:09,530 >> DOUG LLOYD: Vos forsit puto Codex est adsuesco assuesco ut perficiam opus. 3 00:00:09,530 --> 00:00:10,450 Scribis eam. 4 00:00:10,450 --> 00:00:11,664 Aliquid agit. 5 00:00:11,664 --> 00:00:12,580 Ut 'pulchellus ultum it. 6 00:00:12,580 --> 00:00:13,160 >> Vos compilare eam. 7 00:00:13,160 --> 00:00:13,993 Concurrentibus vobis progressio. 8 00:00:13,993 --> 00:00:15,370 Bonum es ire. 9 00:00:15,370 --> 00:00:17,520 >> Sed non credunt nisi Codicis non diu, 10 00:00:17,520 --> 00:00:20,550 ut vos vere venistis ad videndum quod aliquid codice pulchra. 11 00:00:20,550 --> 00:00:23,275 Eam solvit a forsit in a valde interesting via, 12 00:00:23,275 --> 00:00:26,510 aut sicut aliquid, illic 'realiter neat respicit ad viam. 13 00:00:26,510 --> 00:00:28,750 Vos vires exsisto ridens : at verum. 14 00:00:28,750 --> 00:00:31,530 Et uno modo est recursion ad sort of talis idea 15 00:00:31,530 --> 00:00:34,090 pulchra, eleganti aspectu code. 16 00:00:34,090 --> 00:00:37,740 Eam solvit quaestiones in viis, quæ studium facile visualise, 17 00:00:37,740 --> 00:00:39,810 et mire brevis. 18 00:00:39,810 --> 00:00:43,190 >> Viam recursion opera est, a recursive functio 19 00:00:43,190 --> 00:00:49,291 definitur functio vocat partem se defenderet. 20 00:00:49,291 --> 00:00:51,790 Quod minime mirum videri possit, modicum et iam 21 00:00:51,790 --> 00:00:53,750 quomodo hoc operatur in momento. 22 00:00:53,750 --> 00:00:55,560 Sed iterum, haec recursive ratio es 23 00:00:55,560 --> 00:00:57,730 iens futurus exquisitissimus quia ipsi erant 'iens 24 00:00:57,730 --> 00:01:00,410 ad istum quoque nodum solvendum sine habens omnia alia regis munia esse 25 00:01:00,410 --> 00:01:02,710 aut haec tempora longa ora sagi alterius. 26 00:01:02,710 --> 00:01:06,310 Youll 'animadverto ut his recursive procedendi sunt iens ut respicere tam brevi. 27 00:01:06,310 --> 00:01:10,610 Et revera facturus vultus vestri codice multo pulchrius. 28 00:01:10,610 --> 00:01:12,560 >> Dabo vobis relinquens exemplum huius ut videat quomodo 29 00:01:12,560 --> 00:01:14,880 a recursive ratio posset definiri. 30 00:01:14,880 --> 00:01:18,202 In hac igitur si tu math genus de pluribus abhinc annis, 31 00:01:18,202 --> 00:01:20,910 illic 'aliquid vocavit factorial operatione consistat, quae est usitas 32 00:01:20,910 --> 00:01:25,340 auditaque denotatur ut punctum, quod omnium numerorum integrorum positivorum definitur. 33 00:01:25,340 --> 00:01:28,850 Et eo modo quo supra n factorial computata 34 00:01:28,850 --> 00:01:31,050 is multiplicaveritis omnes numeros minus 35 00:01:31,050 --> 00:01:33,750 aut aequalis n together-- omnes minores numeri integri 36 00:01:33,750 --> 00:01:34,880 aut aequalis n simul. 37 00:01:34,880 --> 00:01:39,850 >> Sic V factorial est V temporibus III IV times II temporibus I tempora. 38 00:01:39,850 --> 00:01:43,020 Et factorial IV est IV times III tempora temporibus I II et cetera. 39 00:01:43,020 --> 00:01:44,800 Vos adepto idea. 40 00:01:44,800 --> 00:01:47,060 >> Ut programmers consecuti sumus non deficimus adhibere n, exclamation punctum. 41 00:01:47,060 --> 00:01:51,840 Sic puteus 'definire factorial munus hoc n. 42 00:01:51,840 --> 00:01:56,897 Et puteus 'utor factorial creare a recursive solutio ad problema. 43 00:01:56,897 --> 00:01:59,230 Et, puto, ut cognoscam et inveniam ut magis uisum sit amet 44 00:01:59,230 --> 00:02:02,380 appellandi quam iterative poema poematis of hoc, quod 45 00:02:02,380 --> 00:02:05,010 Vide etiam puteus momento. 46 00:02:05,010 --> 00:02:08,310 >> Hic es a iugo of facts-- pun intended-- 47 00:02:08,310 --> 00:02:10,169 about the factorial-- factorial munus. 48 00:02:10,169 --> 00:02:13,090 Et de I factorial ut dixi, I. 49 00:02:13,090 --> 00:02:15,690 Et factorial of II est II temporibus I. 50 00:02:15,690 --> 00:02:18,470 Et factorial est III of III I II temporibus tempora, et sic deinceps. 51 00:02:18,470 --> 00:02:20,810 IV et V, iam sumus locuti. 52 00:02:20,810 --> 00:02:23,940 >> Quod vero spectat ad hoc, non est hoc verum est? 53 00:02:23,940 --> 00:02:28,220 Non factorial of iustus II II temporibus ex I factorial? 54 00:02:28,220 --> 00:02:31,130 Inquam, de I factorial non I. 55 00:02:31,130 --> 00:02:34,940 Quare non possumus dicere quod Cum factorial of II est II temporibus I, 56 00:02:34,940 --> 00:02:38,520 suus 'vere iustus II times et factorial of I? 57 00:02:38,520 --> 00:02:40,900 >> Et extendens quod idea, non est factorial of III 58 00:02:40,900 --> 00:02:44,080 iustus III temporibus factorial of II? 59 00:02:44,080 --> 00:02:50,350 Et factorial IV of IV temporibus est in III de factorial, et sic porro; 60 00:02:50,350 --> 00:02:52,530 In facto, factorial quotcunque can iustus 61 00:02:52,530 --> 00:02:54,660 si nos genus exprimi de hoc patro aeternum. 62 00:02:54,660 --> 00:02:56,870 Possumus genus generaliter et factorial problem 63 00:02:56,870 --> 00:02:59,910 ut suus 'n temporum factorial minus I n. 64 00:02:59,910 --> 00:03:04,840 Sed interdum ex n omnes numeros infra me. 65 00:03:04,840 --> 00:03:08,890 >> Haec idea, hoc generalization problematis, 66 00:03:08,890 --> 00:03:13,410 nos sinit recursively definire factorial munus. 67 00:03:13,410 --> 00:03:15,440 Cum definis functio recursively, illic ' 68 00:03:15,440 --> 00:03:17,470 duo quae pars necessaria est. 69 00:03:17,470 --> 00:03:20,990 Est enim aliquid dicitur basi casu, quas cum ingressus fueris non trigger, 70 00:03:20,990 --> 00:03:22,480 auferam recursive processus. 71 00:03:22,480 --> 00:03:25,300 >> Alioquin, quod vocat functio itself-- ut homo vestris imagine-- 72 00:03:25,300 --> 00:03:26,870 posse in infinitum. 73 00:03:26,870 --> 00:03:29,047 Functio vocat functio vocat functio vocat 74 00:03:29,047 --> 00:03:30,380 functio vocat functio. 75 00:03:30,380 --> 00:03:32,380 Si non habent videretur, si prohiberet, vestri progressio 76 00:03:32,380 --> 00:03:34,760 erit efficaciter adhæsit at infinitum loop. 77 00:03:34,760 --> 00:03:37,176 Erit eventually fragosus, quia iam memoria elabuntur. 78 00:03:37,176 --> 00:03:38,990 Sed quod est praeter propositum. 79 00:03:38,990 --> 00:03:42,210 >> Oportet enim aliter stare praeterea nostra progressio fragosus, 80 00:03:42,210 --> 00:03:46,010 quia is progressio ut inruerit forsit non pulchra elegantiae arbiter. 81 00:03:46,010 --> 00:03:47,690 Et ideo hoc turpe sit. 82 00:03:47,690 --> 00:03:50,610 Hoc est a simplex solutio ad a forsit quod sistit 83 00:03:50,610 --> 00:03:52,770 in recursive processus fiat. 84 00:03:52,770 --> 00:03:55,220 Ita quod una pars eius a recursive functio. 85 00:03:55,220 --> 00:03:56,820 >> Secunda pars est recursive casu. 86 00:03:56,820 --> 00:03:59,195 Et hoc est ubi recursion et actualiter fiunt. 87 00:03:59,195 --> 00:04:02,200 Hoc est ubi munus vocabis ipsum. 88 00:04:02,200 --> 00:04:05,940 >> Hoc ipsum, ne dicam plane eodem modo dicebatur. 89 00:04:05,940 --> 00:04:08,880 Itll 'exsisto a levi variatio facit ut suus 'forsit 90 00:04:08,880 --> 00:04:11,497 teeny conatur solvere aliquantulus minor. 91 00:04:11,497 --> 00:04:14,330 Sed quo saepius transit hirci solvendorum molem solutionis 92 00:04:14,330 --> 00:04:17,450 aliud dico, interfectus est. 93 00:04:17,450 --> 00:04:20,290 >> Quemnam horum vultus quasi basi casu huc venire voluisti? 94 00:04:20,290 --> 00:04:25,384 Quis similis est horum simplicissima solutio ad problema? 95 00:04:25,384 --> 00:04:27,550 Habemus factorials fasciculum, et continuari posset, 96 00:04:27,550 --> 00:04:30,470 VI on-- geruntur, VII, VIII, IX, X, et sic de aliis. 97 00:04:30,470 --> 00:04:34,130 >> Sed horum similis Bona causa esse basi casu. 98 00:04:34,130 --> 00:04:35,310 Suus 'a simplex solutio. 99 00:04:35,310 --> 00:04:37,810 Neque enim est aliquid speciale. 100 00:04:37,810 --> 00:04:40,560 >> In I factorial of iustus I. 101 00:04:40,560 --> 00:04:42,790 Neque enim agere multiplicatio omnino. 102 00:04:42,790 --> 00:04:45,248 Videtur tamquam si itis solvere conari, 103 00:04:45,248 --> 00:04:47,600 et nos postulo ut obturarent capita Recursion alicubi, 104 00:04:47,600 --> 00:04:50,610 nos forsit volo ut subsisto quum ad I. 105 00:04:50,610 --> 00:04:54,580 Nolumus tincidunt ante. 106 00:04:54,580 --> 00:04:56,660 >> Si sumus definiens nostri factorial munus, 107 00:04:56,660 --> 00:04:58,690 hic enim osseus quomodo possemus facere. 108 00:04:58,690 --> 00:05:03,110 Nos postulo ut plug in duo illa things-- basi casu et recursive casu. 109 00:05:03,110 --> 00:05:04,990 Quid basi casu? 110 00:05:04,990 --> 00:05:10,150 I n si aequalis redde quod 1-- vere simplicem quaestionem solvit. 111 00:05:10,150 --> 00:05:11,890 >> In I factorial of is I. 112 00:05:11,890 --> 00:05:13,860 I Non nisi temporibus. 113 00:05:13,860 --> 00:05:15,020 Suus 'iustus I. 114 00:05:15,020 --> 00:05:17,170 Vestibulum facilisis enim. 115 00:05:17,170 --> 00:05:19,620 Et ideo potest esse nostræ. 116 00:05:19,620 --> 00:05:24,730 Si posset transiret in I functio, nos iustus reverti I. 117 00:05:24,730 --> 00:05:27,320 >> Quid recursive casu forsit vultus amo? 118 00:05:27,320 --> 00:05:32,445 Pro omni alio numero praeter I quid fieret? 119 00:05:32,445 --> 00:05:35,780 Bene, auferens sumus immo et factorial n, 120 00:05:35,780 --> 00:05:38,160 suus 'n temporum factorial minus I n. 121 00:05:38,160 --> 00:05:42,130 >> Si enim nos deferunt factorial III, suus 'III temporibus minus I factorial of III, 122 00:05:42,130 --> 00:05:43,070 vel II. 123 00:05:43,070 --> 00:05:47,330 Et ideo si non sumus respiciens ad I, aliter 124 00:05:47,330 --> 00:05:51,710 reditum n temporum factorial minus I n. 125 00:05:51,710 --> 00:05:53,210 Suus 'pulchellus fictos. 126 00:05:53,210 --> 00:05:57,360 >> Et cum propter ignominiam lautus et suavius ​​elegantiusve code, 127 00:05:57,360 --> 00:06:01,440 quoniam si unius lineae habemus ansas aut ad aliquam simpla-line conditionalis rami, 128 00:06:01,440 --> 00:06:04,490 carere possumus omnes crispus adstringit circa eos. 129 00:06:04,490 --> 00:06:06,850 Considerari ergo potest consolidant huic. 130 00:06:06,850 --> 00:06:09,640 Hoc exigo idem eadem idem functionality sicut est hodie. 131 00:06:09,640 --> 00:06:13,850 >> Im 'iustus sublatis crispus adstringit, quia una tantum 132 00:06:13,850 --> 00:06:18,500 quas conditiones inside of palmitum suorum. 133 00:06:18,500 --> 00:06:21,160 Ita et hi faciunt idem. 134 00:06:21,160 --> 00:06:23,800 I n si aequalis convertere I. 135 00:06:23,800 --> 00:06:28,351 Aliter redire n vicibus of the factorial minus I n. 136 00:06:28,351 --> 00:06:29,850 Ita et nos erant 'faciendo minorem problematis. 137 00:06:29,850 --> 00:06:33,850 Tamquam si n incipit V, erant 'iens ut revertetur V temporibus of factorial IV. 138 00:06:33,850 --> 00:06:37,100 Et cum iam per minutum dicimus de vocatione stack-- in alio video 139 00:06:37,100 --> 00:06:39,390 ubi demorati sumus loqui de vocant stack-- puteus 'perceptum 140 00:06:39,390 --> 00:06:41,630 quare de hoc exacte processus operatur. 141 00:06:41,630 --> 00:06:46,970 >> Sed dum factorial of V dicit revertetur V temporibus of factorial IV, IV et 142 00:06:46,970 --> 00:06:49,710 dicturus, OK bene reditum III et IV temporibus factorial. 143 00:06:49,710 --> 00:06:51,737 Et sicut tu ipse domine perspicis sumus sort of I appropinquare. 144 00:06:51,737 --> 00:06:53,820 Nos 'questus propius et concessi viciniores eidem basi casu. 145 00:06:53,820 --> 00:06:58,180 >> Et semel ledo basi casu, omnes functiones priore 146 00:06:58,180 --> 00:07:00,540 responsio non quaerebant. 147 00:07:00,540 --> 00:07:03,900 Factorial of II dicebat return II temporibus ex I factorial. 148 00:07:03,900 --> 00:07:06,760 Well, I factorial of I redit. 149 00:07:06,760 --> 00:07:10,090 Sic enim vocationem factorial II of II temporibus I redire possunt, 150 00:07:10,090 --> 00:07:13,980 et dare ad factorial of III, quod eam rem pertineat exspecto. 151 00:07:13,980 --> 00:07:17,110 >> Et tunc non potest computare effectum, est III VI II temporibus, 152 00:07:17,110 --> 00:07:18,907 reddes autem et factorial IV. 153 00:07:18,907 --> 00:07:20,740 Et iterum, habemus a video in ACERVUS call 154 00:07:20,740 --> 00:07:23,810 ubi hoc illustrari potest a little plus est quod nunc loquor. 155 00:07:23,810 --> 00:07:25,300 Sed huius modi est. 156 00:07:25,300 --> 00:07:29,300 Hoc solum est solutio colligendis factorial numeri. 157 00:07:29,300 --> 00:07:31,527 >> Suus 'tantum quatuor lineas of code. 158 00:07:31,527 --> 00:07:32,610 Quod suus pulchellus frigus iudicium 159 00:07:32,610 --> 00:07:35,480 Suus 'genus parum pudici. 160 00:07:35,480 --> 00:07:38,580 >> Ita in genere, sed non semper a recursive functio 161 00:07:38,580 --> 00:07:41,190 substituere potest a loop in a non-recursive functio. 162 00:07:41,190 --> 00:07:46,100 Hic igitur, iuxta est adipisicing version of the factorial munus. 163 00:07:46,100 --> 00:07:49,650 Utrumque autem horum calculate omnino idem. 164 00:07:49,650 --> 00:07:52,170 >> Videruntque ambo computare factorial n. 165 00:07:52,170 --> 00:07:54,990 Versionem a sinistris utitur recursion faceret. 166 00:07:54,990 --> 00:07:58,320 Versionem a dextris utitur iteratione, ut faciam illud. 167 00:07:58,320 --> 00:08:02,050 >> Et notandum nobis annuntiabit an integer variabilis productum. 168 00:08:02,050 --> 00:08:02,940 Et tunc nos loop. 169 00:08:02,940 --> 00:08:06,790 Quamdiu n majus 0, custodiunt multiplicans quod productum n 170 00:08:06,790 --> 00:08:09,890 et usque decrementing n computemus productum. 171 00:08:09,890 --> 00:08:14,600 Haec igitur duo munia rursus faciunt exigo idem eadem idem res. 172 00:08:14,600 --> 00:08:19,980 Sed neque illud in eodem prorsus modo. 173 00:08:19,980 --> 00:08:22,430 >> Non autem est possibile habere plus quam unam base 174 00:08:22,430 --> 00:08:25,770 casu plurave quam unum recursive casu, secundum 175 00:08:25,770 --> 00:08:27,670 quod munus tuum facere conatur. 176 00:08:27,670 --> 00:08:31,650 Non necesse est justus limitatum ad unius basi casu vel uno recursive 177 00:08:31,650 --> 00:08:32,370 casu. 178 00:08:32,370 --> 00:08:35,320 Itaque exemplum aliquid cum base multiple casibus 179 00:08:35,320 --> 00:08:37,830 ut sit in Teraho Uidelicet numerum sequence. 180 00:08:37,830 --> 00:08:41,549 >> Ut ab opere revocandi elementares schola diebus 181 00:08:41,549 --> 00:08:45,740 quod Fibonacci sequence definitur sicut Teraho primum elementum est 0. 182 00:08:45,740 --> 00:08:46,890 Secundo elementum est I. 183 00:08:46,890 --> 00:08:49,230 Qui ambo sunt posita. 184 00:08:49,230 --> 00:08:55,920 >> Tunc cuilibet alteri elemento definitur ut summa minus I n et n minus II. 185 00:08:55,920 --> 00:09:00,330 Et tertius esset I 0 plus I est. 186 00:09:00,330 --> 00:09:03,280 Et dein agitur de quarto elementum esset secundum, I, 187 00:09:03,280 --> 00:09:06,550 plus tertius, I. 188 00:09:06,550 --> 00:09:08,507 Et quod esset II. 189 00:09:08,507 --> 00:09:09,340 Et sic de aliis, et sic porro. 190 00:09:09,340 --> 00:09:11,680 >> Ac per hoc, ut base duo casibus. 191 00:09:11,680 --> 00:09:14,850 I n si aequalis convertere 0. 192 00:09:14,850 --> 00:09:18,560 Si n aequalis II, I redire. 193 00:09:18,560 --> 00:09:25,930 Alioquin, revertentur de Fibonacci n Fibonacci plus minus I n minus II. 194 00:09:25,930 --> 00:09:27,180 >> Sic ut 'multiple base casibus. 195 00:09:27,180 --> 00:09:29,271 Quid ergo fiet de multiple recursive judicetis? 196 00:09:29,271 --> 00:09:31,520 Bene, illic 'aliquid vocavit Collatz coniectura coarguuntur. 197 00:09:31,520 --> 00:09:34,630 Mitto enim dicere nescis quid sit quod, 198 00:09:34,630 --> 00:09:38,170 quoniam suus 'actu ultimae quaestio enim haec video. 199 00:09:38,170 --> 00:09:43,220 Quod suus 'nostrum exercitium operari simul. 200 00:09:43,220 --> 00:09:46,760 >> Ita hic 'quod Collatz coniectura is-- 201 00:09:46,760 --> 00:09:48,820 omne quod convenit integer. 202 00:09:48,820 --> 00:09:51,500 Et speculatur quod suus ' semper impetro tergum 203 00:09:51,500 --> 00:09:55,060 si autem ambulaveris in gradibus I. 204 00:09:55,060 --> 00:09:57,560 Si n est I prohiberent. 205 00:09:57,560 --> 00:10:00,070 Nos si n I I reditum. 206 00:10:00,070 --> 00:10:05,670 >> Alioquin, per hoc processus iterum n dividatur per II. 207 00:10:05,670 --> 00:10:08,200 Et vide si potes redire I. 208 00:10:08,200 --> 00:10:13,260 Alioquin, si n sit numerus impar, per hoc processu iterum 3n plus I, 209 00:10:13,260 --> 00:10:15,552 plus I vel III tempora n. 210 00:10:15,552 --> 00:10:17,010 Hic habemus unum turpis est. 211 00:10:17,010 --> 00:10:18,430 I n si aequalis prohiberent. 212 00:10:18,430 --> 00:10:20,230 Non sumus ulla magis recursion. 213 00:10:20,230 --> 00:10:23,730 >> Habemus duo recursive casibus. 214 00:10:23,730 --> 00:10:28,750 N Si quidem nos facere recursive casu, vocatio n dividatur per II. 215 00:10:28,750 --> 00:10:33,950 Si n sit numerus impar facimus aliud I n plus temporis in casu recursive III. 216 00:10:33,950 --> 00:10:39,120 >> Video enim et finis ad secundam silentium video, 217 00:10:39,120 --> 00:10:42,440 et conanda et scribere recursive functio Collatz 218 00:10:42,440 --> 00:10:47,640 in qua n valorem et it reputet quot gradibus 219 00:10:47,640 --> 00:10:52,430 Inde fit, ut ad I n si et sequere vestigia illa superne. 220 00:10:52,430 --> 00:10:56,660 Si n est I, capit 0 gradus. 221 00:10:56,660 --> 00:11:00,190 Alioquin suus 'iens adhibe tecum adhuc unum tamen plus ego morsque dividimur 222 00:11:00,190 --> 00:11:06,200 multa passus sumit aut n Si n II divisa est et plus I 3n 223 00:11:06,200 --> 00:11:08,100 si n sit numerus impar. 224 00:11:08,100 --> 00:11:11,190 >> Nunc Ive 'posuere in screen hic test duobus pro te 225 00:11:11,190 --> 00:11:15,690 duobus casibus expertus vos videre quid his variis Collatz numeri sunt, 226 00:11:15,690 --> 00:11:17,440 et exemplum de gradibus 227 00:11:17,440 --> 00:11:20,390 vos postulo ut transiri quaedam ex hac causa actione. 228 00:11:20,390 --> 00:11:24,222 Si n est aequalis I, de qua n Collatz est 0. 229 00:11:24,222 --> 00:11:26,180 Vos dont 'have efficio I quod ulciscor. 230 00:11:26,180 --> 00:11:27,600 Tu, jamque illic cupit. 231 00:11:27,600 --> 00:11:30,550 >> Si n II capit I gradum pervenias. 232 00:11:30,550 --> 00:11:31,810 Vos satus II. 233 00:11:31,810 --> 00:11:33,100 Etiam non cft I II. 234 00:11:33,100 --> 00:11:36,580 Sic futurum gradum plus tamen multis gradibus 235 00:11:36,580 --> 00:11:38,015 accipit n dividatur per II. 236 00:11:38,015 --> 00:11:41,280 237 00:11:41,280 --> 00:11:42,910 >> Divisa est II I II. 238 00:11:42,910 --> 00:11:47,200 Ita fit unum gradum plus tamen I opinatur multa passus. 239 00:11:47,200 --> 00:11:49,720 I nulla fit gradus. 240 00:11:49,720 --> 00:11:52,370 >> III Nam, ut vides, non admodum a paucis gradus versatur. 241 00:11:52,370 --> 00:11:53,590 Vos amicietur doctor ibunt de III. 242 00:11:53,590 --> 00:11:56,710 Et tunc ire X, V, XVI, VIII, IV, II, I. 243 00:11:56,710 --> 00:11:58,804 Accipit gradibus septem redire I. 244 00:11:58,804 --> 00:12:01,220 Et sicut tu ipse domine perspicis illic ' aliis duobus casibus test here 245 00:12:01,220 --> 00:12:02,470 experiri vestri progressio. 246 00:12:02,470 --> 00:12:03,970 Similiter silentium video. 247 00:12:03,970 --> 00:12:09,210 Et quidem ego ibo ad flguras quod actu est, 248 00:12:09,210 --> 00:12:11,390 quid haec coniectura est. 249 00:12:11,390 --> 00:12:14,140 >> Si vos can instar sicco quam definire Collatz n 250 00:12:14,140 --> 00:12:19,967 ut reputet quot I ad gradum capit. 251 00:12:19,967 --> 00:12:23,050 Sic hopefully vos video constiterunt et non me expectant iusti 252 00:12:23,050 --> 00:12:25,820 hic dare responsum. 253 00:12:25,820 --> 00:12:29,120 Si autem bene hic responsum usquam. 254 00:12:29,120 --> 00:12:33,070 >> Sic hic 'possibilis definition de Collatz munus. 255 00:12:33,070 --> 00:12:35,610 Our base case-- si n est I aequalis, revertamur 0. 256 00:12:35,610 --> 00:12:38,250 Non ergo amplius accipere I gradus redire. 257 00:12:38,250 --> 00:12:42,710 >> Alioquin spectationes habemus duas recursive cases-- et unum numero impari. 258 00:12:42,710 --> 00:12:47,164 Modo numeris experiendi est, ad reprimendam si n mod II 0 pares. 259 00:12:47,164 --> 00:12:49,080 Hoc est basically, rursus, interrogans quaestionem, 260 00:12:49,080 --> 00:12:54,050 si revocantur in memoriam quae mod is-- si divide per II n non est reliquum? 261 00:12:54,050 --> 00:12:55,470 Quod si numerus par. 262 00:12:55,470 --> 00:13:01,370 >> Et eodem modo si n sit 0 pares mod II testis est numerus par. 263 00:13:01,370 --> 00:13:04,250 Sic volo redire I, quia hoc est certus 264 00:13:04,250 --> 00:13:09,270 accipiens unus plus step Collatz of Dimidium quotcumque me. 265 00:13:09,270 --> 00:13:13,910 Sin autem noluerit redire I plus Collatz of III temporibus I plus n. 266 00:13:13,910 --> 00:13:16,060 Quod fuit alter recursive quia ego morsque dividimur 267 00:13:16,060 --> 00:13:19,470 posset computare Collatz-- numerum gressus 268 00:13:19,470 --> 00:13:22,610 capit ut impetro tergum ad I datus est eis numerus. 269 00:13:22,610 --> 00:13:24,610 Sic hopefully hoc exemplum dedit vobis potestatem pauco 270 00:13:24,610 --> 00:13:26,620 saporis est recursive elit. 271 00:13:26,620 --> 00:13:30,220 Utinam tibi signum est paulo pulchrius si implemented 272 00:13:30,220 --> 00:13:32,760 in elegantem, recursive via. 273 00:13:32,760 --> 00:13:35,955 Sed etiam si non est a recursion vere potens tool tamen. 274 00:13:35,955 --> 00:13:38,330 Et sic suus 'certus aliquid impetro caput tuum circum, 275 00:13:38,330 --> 00:13:41,360 quoniam tu posse creare pulchellus frigus progressio usura recursion 276 00:13:41,360 --> 00:13:45,930 quod alias esset complexus scribere et si tibi usura ansas iterationem. 277 00:13:45,930 --> 00:13:46,980 Im Doug Lloyd. 278 00:13:46,980 --> 00:13:48,780 Hoc est CS50. 279 00:13:48,780 --> 00:13:50,228