1
00:00:00,000 --> 00:00:05,830

2
00:00:05,830 --> 00:00:07,910
>> Omni jure, ita, computational complexionem.

3
00:00:07,910 --> 00:00:10,430
Iustus aliquantulus of monitionem
antequam nos intendere in too far--

4
00:00:10,430 --> 00:00:13,070
hoc youll 'forsit esse inter
maxime gravia math-

5
00:00:13,070 --> 00:00:14,200
dicemus in CS50.

6
00:00:14,200 --> 00:00:16,950
Utinam non multum superante
et requiem tibi dabo operam

7
00:00:16,950 --> 00:00:19,200
per processus, sed
tantillum pulchro admonitio.

8
00:00:19,200 --> 00:00:21,282
Illic 'a pauco
math insunt.

9
00:00:21,282 --> 00:00:23,990
Omni jure, ita ut
usum nostrum computational resources

10
00:00:23,990 --> 00:00:28,170
in rerum world-- suus
maximus intelligere algorithms

11
00:00:28,170 --> 00:00:30,750
et quomodo processionem notitia.

12
00:00:30,750 --> 00:00:32,810
Si non humiliter sentiebam realiter
efficiens algorithm, nos

13
00:00:32,810 --> 00:00:36,292
potest obscuratis amount of resources
utile nobis pati.

14
00:00:36,292 --> 00:00:38,750
Si habemus algorithm
multum opus est ut

15
00:00:38,750 --> 00:00:41,210
ad processionem a vere
set large data est

16
00:00:41,210 --> 00:00:44,030
iens ut plus exigunt
et magis opibus, quae

17
00:00:44,030 --> 00:00:47,980
pecunia RAM omne quod genus effercio.

18
00:00:47,980 --> 00:00:52,090
>> Itaque in mentem posse
algorithm utentes hoc tool set,

19
00:00:52,090 --> 00:00:56,110
basically exquirit question--
unde hoc algorithm scale

20
00:00:56,110 --> 00:00:59,020
magis quam conciliavit ipsa quae proiiciuntur?

21
00:00:59,020 --> 00:01:02,220
In CS50, summa erant data
opus est pulchellus minima.

22
00:01:02,220 --> 00:01:05,140
Generaliter, nostra progressio geruntur
secundo cursu less--

23
00:01:05,140 --> 00:01:07,830
probabiliter multum minus
praesertim diluculo on.

24
00:01:07,830 --> 00:01:12,250
>> Sed quia de paucis agitur
centum milia elit.

25
00:01:12,250 --> 00:01:14,970
Et opus ad processionem
ut mos notitia.

26
00:01:14,970 --> 00:01:18,260
Sicut numerus of elit ipsi
habent gets maior et maior,

27
00:01:18,260 --> 00:01:21,230
suus 'iens requiram
magis et magis opibus.

28
00:01:21,230 --> 00:01:22,926
Quanto plures opibus subiaceas?

29
00:01:22,926 --> 00:01:25,050
Bene, quod dependet quam
nos resolvere algorithm,

30
00:01:25,050 --> 00:01:28,097
Mutationes conlatae hoc utitur instrumentis.

31
00:01:28,097 --> 00:01:31,180
Si loquamur de multiplicitate
an algorithm quod quandoque youll '

32
00:01:31,180 --> 00:01:34,040
audire relatum ut ut tempus
complexitate aut spatium complexionem

33
00:01:34,040 --> 00:01:36,190
sed erant 'iustus iens
vocare complexity--

34
00:01:36,190 --> 00:01:38,770
erant generaliter loquitur de
Pessimum-casu missione.

35
00:01:38,770 --> 00:01:42,640
Datum est simpliciter maximum struem
data missurus possemus illud

36
00:01:42,640 --> 00:01:46,440
quomodo hoc algorithm iens
data vel aliquid de illo?

37
00:01:46,440 --> 00:01:51,450
Nos pessimus-casu communiter
runtime of an algorithm O magnum.

38
00:01:51,450 --> 00:01:56,770
Sic algorithm diceretur
O n o n quadratis seu curreret.

39
00:01:56,770 --> 00:01:59,110
Et de more illis
illae in altera.

40
00:01:59,110 --> 00:02:01,620
>> Quandoque tamen non curant
maxime in casu missione.

41
00:02:01,620 --> 00:02:05,400
Si omnia data voluimus
Erat esse absolutum

42
00:02:05,400 --> 00:02:09,630
Eramus autem in hac perfecta mittens
set per algorithm elit.

43
00:02:09,630 --> 00:02:11,470
Quid hoc foret in illo situ tractare?

44
00:02:11,470 --> 00:02:15,050
Audimus aliquando voces referuntur ad quod
magnum-Omega, ita contra O-magna,

45
00:02:15,050 --> 00:02:16,530
magnum-habemus Omega.

46
00:02:16,530 --> 00:02:18,880
Maximo Omega optimus-casu missione.

47
00:02:18,880 --> 00:02:21,319
Maximo pessimum o-casu missione.

48
00:02:21,319 --> 00:02:23,860
Generaliter, cum loqui
multiplicitate an algorithm,

49
00:02:23,860 --> 00:02:26,370
nos loquentes de
Pessimum-casu missione.

50
00:02:26,370 --> 00:02:28,100
Ita in mente custodi.

51
00:02:28,100 --> 00:02:31,510
>> Quo in genere sumus plerumque exitus
omisso rigore deposito nibh.

52
00:02:31,510 --> 00:02:35,350
Sunt scientiae et agri
genus effercio huic scientiae deditas.

53
00:02:35,350 --> 00:02:37,610
Cum nos loqui de ratiocinatione
per algorithms,

54
00:02:37,610 --> 00:02:41,822
quod puteus 'operor piece-by-piece pro multis
algorithms in genere dicemus.

55
00:02:41,822 --> 00:02:44,780
Erant vere iustus meditentur
ea ratione per sensum communem,

56
00:02:44,780 --> 00:02:47,070
Non formulis aut argumentis
aut aliquid huiusmodi.

57
00:02:47,070 --> 00:02:51,600
Nolite ergo solliciti esse dicentes
conversus in magnum math class.

58
00:02:51,600 --> 00:02:55,920
>> Et dixi ad complexionem curamus
quod rogat quaestio,

59
00:02:55,920 --> 00:03:00,160
do nostri algorithms tractare maiorem et
maior notitia sets elisus in eis.

60
00:03:00,160 --> 00:03:01,960
Quid est data copia?

61
00:03:01,960 --> 00:03:03,910
Quid intendimus cum diceret?

62
00:03:03,910 --> 00:03:07,600
Significat quod facit ad hoc maxime
secundum contextum sit amet.

63
00:03:07,600 --> 00:03:11,160
Si habemus algorithm est
Processus Strings-- sumus probably

64
00:03:11,160 --> 00:03:13,440
de magnitudine filum.

65
00:03:13,440 --> 00:03:15,190
Ut 'data set--
magnitudo, numerus

66
00:03:15,190 --> 00:03:17,050
notis faciunt nervo.

67
00:03:17,050 --> 00:03:20,090
Si dicas an de
algorithm files quod procedit,

68
00:03:20,090 --> 00:03:23,930
nos efficeremur meditentur quam
multi kilobytes complecti ut lima.

69
00:03:23,930 --> 00:03:25,710
Et data est copia.

70
00:03:25,710 --> 00:03:28,870
Si dicas algorithm
ut tracto vestit magis generaliter,

71
00:03:28,870 --> 00:03:31,510
qualis voluptua algorithms
quaerere aut algorithms,

72
00:03:31,510 --> 00:03:36,690
nos loquentes de numero 'forsit
variae elementorum complecti.

73
00:03:36,690 --> 00:03:39,272
>> Nunc, uti possumus modum
algorithm in particulari,

74
00:03:39,272 --> 00:03:40,980
cum dico possumus
metiri an algorithm, I

75
00:03:40,980 --> 00:03:43,840
volumus metiri potest, quam
opibus multis suscipit.

76
00:03:43,840 --> 00:03:48,990
An ea copia, quot
bytes of megabytes RAM-- vel of RAM

77
00:03:48,990 --> 00:03:49,790
utitur.

78
00:03:49,790 --> 00:03:52,320
Aut quanto tempore potest currere.

79
00:03:52,320 --> 00:03:56,200
Et hoc modo potest dici
metiantur fabricam, pro libitu suo, f n.

80
00:03:56,200 --> 00:03:59,420
Ubi n est numerus
elementa in notitia paro.

81
00:03:59,420 --> 00:04:02,640
Et f n est quot aliqua.

82
00:04:02,640 --> 00:04:07,530
Quot unitates resources facit
exigit ut ad processionem notitia.

83
00:04:07,530 --> 00:04:10,030
>> Et vere non curo
quid f n est exigo.

84
00:04:10,030 --> 00:04:13,700
Atqui nos rarissime will--
certe numquam in hoc ego class--

85
00:04:13,700 --> 00:04:18,709
introspicere altius quis vere profundum
f quod analysis of n.

86
00:04:18,709 --> 00:04:23,510
Erant 'iustus iens dicere quod f
n est proxime vel quid ad illud tendit.

87
00:04:23,510 --> 00:04:27,600
Et quod pronitas algorithm
dictatus sit a supremo ordine term.

88
00:04:27,600 --> 00:04:29,440
Et vide quid possumus
per quod intelligitur per carnem assumptam,

89
00:04:29,440 --> 00:04:31,910
Ut a inviso certiorem.

90
00:04:31,910 --> 00:04:34,620
>> Sic dicunt quod habemus
tribus diversis algorithms.

91
00:04:34,620 --> 00:04:39,350
Quarum prima accipit n
triplicata, Nonnullae unitates opibus

92
00:04:39,350 --> 00:04:42,880
a magnitudine data set processus n.

93
00:04:42,880 --> 00:04:47,000
Sed secundum se utilem
n triplicata plus n quadrantur resources

94
00:04:47,000 --> 00:04:49,350
a magnitudine data set processus n.

95
00:04:49,350 --> 00:04:52,030
Et habemus a tertio
algorithm qui decurrit in-- quod

96
00:04:52,030 --> 00:04:58,300
assumit n triplicata minus 8n quadratis
plus XX n unitates resources

97
00:04:58,300 --> 00:05:02,370
ad processionem an algorithm
cum data set molis n.

98
00:05:02,370 --> 00:05:05,594
>> Porro jam revera non
ut in hoc ordine singula.

99
00:05:05,594 --> 00:05:08,260
Im 'vere iustus dedendo
hic exemplum puncti

100
00:05:08,260 --> 00:05:10,176
quod Im 'iens esse
ut in secunda, quae

101
00:05:10,176 --> 00:05:12,980
est quod solum curat
de cursu rerum

102
00:05:12,980 --> 00:05:14,870
ut notitia sets impetro maior.

103
00:05:14,870 --> 00:05:18,220
Si exiguum est data copia, nulla
actu a pulchellus magnus distinctus

104
00:05:18,220 --> 00:05:19,870
haec in algorithms.

105
00:05:19,870 --> 00:05:23,000
Tertio algorithm ibi
accipit XIII plo longioribus,

106
00:05:23,000 --> 00:05:27,980
XIII temporum moles opes
currere ad primum.

107
00:05:27,980 --> 00:05:31,659
>> X Si magnitudine data copia est, quod
maius est, sed non necessario ingens

108
00:05:31,659 --> 00:05:33,950
Videmus enim quod illic '
aliquid actu differentia.

109
00:05:33,950 --> 00:05:36,620
Tertio algorithm
fit magis efficens.

110
00:05:36,620 --> 00:05:40,120
Sed etiam de XL% -
aut LX% magis efficens.

111
00:05:40,120 --> 00:05:41,580
Accipit XL% quantumque temporis.

112
00:05:41,580 --> 00:05:45,250
Potest run-- accipere potest
CD unitates resources

113
00:05:45,250 --> 00:05:47,570
X ad processionem a magnitudine data set.

114
00:05:47,570 --> 00:05:49,410
Prima autem ratio
algorithm, per oppositum,

115
00:05:49,410 --> 00:05:54,520
accipit 1,000 unitates resources
X ad processionem a magnitudine data set.

116
00:05:54,520 --> 00:05:57,240
Sed vide quid accidit
dies nostri numerus augetur adepto etiam maior.

117
00:05:57,240 --> 00:05:59,500
>> Est autem haec differentia
inter haec algorithms

118
00:05:59,500 --> 00:06:01,420
initium fiat minus apparent.

119
00:06:01,420 --> 00:06:04,560
Et quod non sint
inferior-ordo terms-- vel potius,

120
00:06:04,560 --> 00:06:09,390
terms cum inferioribus exponents--
committitur fieri impertinens.

121
00:06:09,390 --> 00:06:12,290
Si a notitia Posueruntque est molis
1,000 et primi algorithm

122
00:06:12,290 --> 00:06:14,170
runs in a billion gressus eorum considerat.

123
00:06:14,170 --> 00:06:17,880
Et in secundo algorithm currit
Sescenti cum decies centum gradibus aditur.

124
00:06:17,880 --> 00:06:20,870
Et tertio algorithm currit
sicut in verecundanti in publicum a billion gressus eorum considerat.

125
00:06:20,870 --> 00:06:22,620
Praesent sescenti fere passibus.

126
00:06:22,620 --> 00:06:25,640
Istis inferioribus secundum ordinem satus-
fieri vere impertinens.

127
00:06:25,640 --> 00:06:27,390
Et iustus ut vere
malleo domum point--

128
00:06:27,390 --> 00:06:31,240
si autem data magnitudine input
fere omnes tres million--

129
00:06:31,240 --> 00:06:34,960
adhibe tecum adhuc unum quintillion-- si
meum math est correct-- gressus

130
00:06:34,960 --> 00:06:37,260
ad processionem a notitia input
molis a million.

131
00:06:37,260 --> 00:06:38,250
Ut sit amet pede.

132
00:06:38,250 --> 00:06:42,092
Et quod unus ex illis, ut
take a iugo 100,000, vel a iugo C

133
00:06:42,092 --> 00:06:44,650
million etiam minus cum
nos Erant 'sermo super numerum

134
00:06:44,650 --> 00:06:46,990
big-- quod suus 'genus impertinens.

135
00:06:46,990 --> 00:06:50,006
Tendunt omnes ad
proxime n triplicata,

136
00:06:50,006 --> 00:06:52,380
et sic volumus actu referre
his omnibus algorithms

137
00:06:52,380 --> 00:06:59,520
quod sit ordo n
triplicata vel magnus O n triplicata.

138
00:06:59,520 --> 00:07:03,220
>> Lorem elenchum quorundam magis
commune computational multiplicitate classes

139
00:07:03,220 --> 00:07:05,820
ut puteus perspiciatis in
algorithms, plerumque.

140
00:07:05,820 --> 00:07:07,970
Et in specie in CS50.

141
00:07:07,970 --> 00:07:11,410
Haec ordinantur ab
ieiunas plerumque in summo,

142
00:07:11,410 --> 00:07:13,940
plerumque tardissime in imo compingantur.

143
00:07:13,940 --> 00:07:16,920
Ita tempus constans algorithms tendunt
esse in ieiunas, cujuscumque

144
00:07:16,920 --> 00:07:19,110
de magnitudine
data vos transire in input.

145
00:07:19,110 --> 00:07:23,760
Adhibe tecum adhuc unum vel operatio semper
opes unum agere.

146
00:07:23,760 --> 00:07:25,730
Is vires exsisto II, poterat
et III, IV posset.

147
00:07:25,730 --> 00:07:26,910
Sed numerus constans.

148
00:07:26,910 --> 00:07:28,400
Non variantur.

149
00:07:28,400 --> 00:07:31,390
>> Logarithmica tempore algorithms
sunt leviter melius.

150
00:07:31,390 --> 00:07:33,950
Et vere bonum exemplum
logarithmica tempus algorithm

151
00:07:33,950 --> 00:07:37,420
youve 'Vidi iam est
disruperit phone libro

152
00:07:37,420 --> 00:07:39,480
invenire Mike Smith in phone libro.

153
00:07:39,480 --> 00:07:40,980
Nos interficiam problema in dimidium.

154
00:07:40,980 --> 00:07:43,580
Et ut n gets maior
et maior et larger--

155
00:07:43,580 --> 00:07:47,290
denique, quotienscumque duplum
n, solum accipit unum gradum.

156
00:07:47,290 --> 00:07:49,770
Sic ut 'multus melior
quam dicunt, linearibus tempus.

157
00:07:49,770 --> 00:07:53,030
Quod si vos rebus duplices pro n,
duplex est gradus.

158
00:07:53,030 --> 00:07:55,980
Si triplici n, capit
triplici numero gressus eorum considerat.

159
00:07:55,980 --> 00:07:58,580
Gradum per unit.

160
00:07:58,580 --> 00:08:01,790
>> Deinde rerum adepto aliquantulus more--
paulo minus magnum inde.

161
00:08:01,790 --> 00:08:06,622
Habes linearibus tempus numerosa, interdum
vocavit log linearibus tempus vel iustus n log n.

162
00:08:06,622 --> 00:08:08,330
Et si tibi placet exemplum
an algorithm of that

163
00:08:08,330 --> 00:08:13,370
currit n log n, melius
quam tempore suo quadratica n quadrat.

164
00:08:13,370 --> 00:08:17,320
Aut polynomial tempore, n duo
quotcunque centra plus quam duobus.

165
00:08:17,320 --> 00:08:20,810
Aut exponential nudius tertius
est etiam worse-- C ad n.

166
00:08:20,810 --> 00:08:24,670
Cedit ergo interdum generosus numerus constans resurrexit
virtus magnitudine input.

167
00:08:24,670 --> 00:08:28,990
Et si illic '1,000-- si
1,000 notitia input est molis,

168
00:08:28,990 --> 00:08:31,310
C ad potentiam 1,000th foret.

169
00:08:31,310 --> 00:08:33,559
Etiam sit amet nunc integra deterior.

170
00:08:33,559 --> 00:08:35,030
>> Factorial tempus est etiam peius.

171
00:08:35,030 --> 00:08:37,760
Ac revera sunt
esse temporis infinitate tendatur algorithms,

172
00:08:37,760 --> 00:08:43,740
ut exemplum afferamus, sic-accersitus stultus Sort-- cuius
opus est aliqua tergiversatione passim an array

173
00:08:43,740 --> 00:08:45,490
et tunc reprehendo ut videret
utrum suus 'sorted.

174
00:08:45,490 --> 00:08:47,589
Et si suus 'non temere
versas array iterum

175
00:08:47,589 --> 00:08:49,130
reprehendo num 'sorted.

176
00:08:49,130 --> 00:08:51,671
Et vos potest probabiliter imagine--
potest imaginari a situ

177
00:08:51,671 --> 00:08:55,200
pessimum, ubi causam apud te
Lorem ipsum non ordinata.

178
00:08:55,200 --> 00:08:57,150
Quod algorithm cursurus esset in aeternum.

179
00:08:57,150 --> 00:08:59,349
Et ut esset
temporis infinitate tendatur algorithm.

180
00:08:59,349 --> 00:09:01,890
Utinam non scripturus
aut quis factorial temporis infinitate tendatur

181
00:09:01,890 --> 00:09:04,510
algorithms in CS50.

182
00:09:04,510 --> 00:09:09,150
>> Sit scriptor paulo
concrete inviso nonnullus simplicior

183
00:09:09,150 --> 00:09:11,154
computational multiplicitate classes.

184
00:09:11,154 --> 00:09:13,070
Sic habemus example--
alterumve exemplum here--

185
00:09:13,070 --> 00:09:15,590
of tempus constans algorithms,
quae semper

186
00:09:15,590 --> 00:09:17,980
unam operationem pessimus-casu.

187
00:09:17,980 --> 00:09:20,050
Ita primum example--
habemus functio

188
00:09:20,050 --> 00:09:23,952
IV dicitur pro vobis,
variae magnitudinis fieri 1,000.

189
00:09:23,952 --> 00:09:25,660
Sed tunc videtur
non actualiter spectant

190
00:09:25,660 --> 00:09:29,000
at it-- non pertinet ad quid
intus enim de illa ordinata.

191
00:09:29,000 --> 00:09:30,820
Usquequaque iustus redit quatuor.

192
00:09:30,820 --> 00:09:32,940
Ita, quod algorithm,
non obstante eo quod

193
00:09:32,940 --> 00:09:35,840
1,000 elementa non accipit
aliquid facere cum eis.

194
00:09:35,840 --> 00:09:36,590
Iustus redit quatuor.

195
00:09:36,590 --> 00:09:38,240
Hic semper uno gradu.

196
00:09:38,240 --> 00:09:41,600
>> In hoc, addere II nums-- quae
weve videri, sicut ante well--

197
00:09:41,600 --> 00:09:43,680
just processus duo numeri integri.

198
00:09:43,680 --> 00:09:44,692
Non uno gradu.

199
00:09:44,692 --> 00:09:45,900
Suus 'vere duos gradus.

200
00:09:45,900 --> 00:09:50,780
Vos adepto a, b tu es aggregare
simul et output praecessi.

201
00:09:50,780 --> 00:09:53,270
Sic suus 'LXXXIV gressus eorum considerat.

202
00:09:53,270 --> 00:09:55,510
Tamen suus 'semper constans,
aut cujuscumque a b.

203
00:09:55,510 --> 00:09:59,240
Habes a, b ut addat
pariter ex output.

204
00:09:59,240 --> 00:10:02,900
Ita ut scriptor constans tempus algorithm.

205
00:10:02,900 --> 00:10:05,170
>> Hic exemplum
linearibus tempus algorithm

206
00:10:05,170 --> 00:10:08,740
an algorithm id quod fit gets--
unum additional gressus possit,

207
00:10:08,740 --> 00:10:10,740
ut vestri input crescit I.

208
00:10:10,740 --> 00:10:14,190
Itaque dicimus quaeritis
V numerus intra aciem.

209
00:10:14,190 --> 00:10:16,774
Vos vires have a situ ubi
satis mane invenire poteritis.

210
00:10:16,774 --> 00:10:18,606
Tamen vos could quoque
a situ ubi

211
00:10:18,606 --> 00:10:20,450
ultimam particulam sit ordinata.

212
00:10:20,450 --> 00:10:23,780
In V variae magnitudinis, si
V dicimus numero quaeritis.

213
00:10:23,780 --> 00:10:25,930
Foret V gradus.

214
00:10:25,930 --> 00:10:29,180
Denique nihil putant
V eiusmodi nec usquam.

215
00:10:29,180 --> 00:10:32,820
Restat etiam respicias
et singula elementum array

216
00:10:32,820 --> 00:10:35,550
in ut determinare
V necne sit.

217
00:10:35,550 --> 00:10:39,840
>> Itaque pessimus-casu quod est
Elementum ultimum in ordine

218
00:10:39,840 --> 00:10:41,700
aut non esse.

219
00:10:41,700 --> 00:10:44,690
Non possumus tamen aliter intueri
omnes n elementis redditus extat.

220
00:10:44,690 --> 00:10:47,120
Et ideo rationabiliter hoc algorithm
currit in linearibus tempus.

221
00:10:47,120 --> 00:10:50,340
Vobis confirmare possum, quod per
extrapolating modicum dicens

222
00:10:50,340 --> 00:10:53,080
VI, si haberemus elementum agmine
quaerebatur numero V,

223
00:10:53,080 --> 00:10:54,890
tenuisti VI gressus eorum considerat.

224
00:10:54,890 --> 00:10:57,620
Si non humiliter sentiebam: VII elementum agmine
V dicimus numero quaeritis.

225
00:10:57,620 --> 00:10:59,160
Tenuisti VII gressus eorum considerat.

226
00:10:59,160 --> 00:11:02,920
Sicut et nos unum adjicientes elementum nostris
array, capit unus plus step.

227
00:11:02,920 --> 00:11:06,750
Quod suus 'a linearibus algorithm
in pessimus-casu.

228
00:11:06,750 --> 00:11:08,270
>> Iugo velox eiusdem quaestiones tibi.

229
00:11:08,270 --> 00:11:11,170
Quid runtime-- quid
pessimus-casu runtime

230
00:11:11,170 --> 00:11:13,700
huius snippet de codice?

231
00:11:13,700 --> 00:11:17,420
Sic EGO have a IV loop hic qui decurrit
de aequo j 0 usque ad m.

232
00:11:17,420 --> 00:11:21,980
Quod cum ego huc quod
corpus loop currit tempus constans.

233
00:11:21,980 --> 00:11:24,730
Ita quod terminis usura
quod weve 'iam loquebatur about--

234
00:11:24,730 --> 00:11:29,390
esset pessimus-casu
runtime huius algorithm?

235
00:11:29,390 --> 00:11:31,050
Take a secundo.

236
00:11:31,050 --> 00:11:34,270
In interiore parte loop
currit in tempus constans.

237
00:11:34,270 --> 00:11:37,510
Et exteriore parte
loop est iens ut currere m vicibus sumtae.

238
00:11:37,510 --> 00:11:40,260
Quid cum programma pessimus-casu hic

239
00:11:40,260 --> 00:11:43,210
Did vos coniecto magnus O-m?

240
00:11:43,210 --> 00:11:44,686
Youd recta prædicent.

241
00:11:44,686 --> 00:11:46,230
>> Quid aliud?

242
00:11:46,230 --> 00:11:48,590
Hoc tempore habemus
loop inside of a loop.

243
00:11:48,590 --> 00:11:50,905
Habemus exteriores loop
ut fugiat nulla p.

244
00:11:50,905 --> 00:11:54,630
Habemus intra loop currit
ro p et intus quod

245
00:11:54,630 --> 00:11:57,890
I, quod in corpore nostro circumferentes
loop currit in tempus constans.

246
00:11:57,890 --> 00:12:02,330
Quid pessimus-casu runtime
huius snippet de codice?

247
00:12:02,330 --> 00:12:06,140
Bene etiam habemus
exterius loop currit temporibus p.

248
00:12:06,140 --> 00:12:09,660
Et tempore suo quisque iterationem
quod ansam veniat, potius.

249
00:12:09,660 --> 00:12:13,170
Habemus interioris loop
etiam p currit temporibus.

250
00:12:13,170 --> 00:12:16,900
Deinde intra quod illic '
modicum ibi snippet constant tempore suo.

251
00:12:16,900 --> 00:12:19,890
>> Sic si habemus loop quod exteriores
p currit temporibus inside of quod

252
00:12:19,890 --> 00:12:22,880
intra quod ansa
currit p times-- quod

253
00:12:22,880 --> 00:12:26,480
pessimus-casu runtime
huius snippet of code?

254
00:12:26,480 --> 00:12:30,730
Did vos coniecto magnus O-of p quadrari?

255
00:12:30,730 --> 00:12:31,690
>> Im Doug Lloyd.

256
00:12:31,690 --> 00:12:33,880
Hoc est CS50.

257
00:12:33,880 --> 00:12:35,622