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

2
00:00:05,760 --> 00:00:08,900
>> DOUG LLOYD: ergo in CS50 didicimus de
a varietate voluptua inquisitionis

3
00:00:08,900 --> 00:00:09,442
algorithms.

4
00:00:09,442 --> 00:00:11,400
Et quandoque potest esse
paulo ancipiti captioni isse obviam ad custodiendam

5
00:00:11,400 --> 00:00:14,161
track of quid facit algorithm.

6
00:00:14,161 --> 00:00:15,910
Ive 'vere nos tantum
cucurrit superficie quoque

7
00:00:15,910 --> 00:00:18,740
multa sunt alia quaerere
et algorithms voluptua.

8
00:00:18,740 --> 00:00:21,780
Ita in hoc video lets
iustus pauci minutes

9
00:00:21,780 --> 00:00:24,980
experiri curabimus, et stillas singulis algorithm
usque ad elementa core

10
00:00:24,980 --> 00:00:27,810
ita meminisse potes maxime
important information about eos

11
00:00:27,810 --> 00:00:31,970
et poterit enuntiatione
differentias, si necesse sit.

12
00:00:31,970 --> 00:00:34,220
>> Quorum primum est Selectionem huiusmodi.

13
00:00:34,220 --> 00:00:38,210
Basic idea post Selectionem cuiusmodi
est invenire minimum Unsorted elementum

14
00:00:38,210 --> 00:00:42,890
et cum exercitu in PERMUTO
unsorted primum elementum ut ordinata.

15
00:00:42,890 --> 00:00:46,620
Diximus pessimus-casu
run tempus quod est numerus quadratum n.

16
00:00:46,620 --> 00:00:50,060
Si quid memorare libet accipe
at dui a genere video.

17
00:00:50,060 --> 00:00:54,560
Optimus-casu currit tempus
etiam n quadrat.

18
00:00:54,560 --> 00:00:58,910
>> Bullæ huiusmodi rationem retro
omnis homo ad proximam PERMUTO adjacent paria.

19
00:00:58,910 --> 00:01:01,730
Ut sit amet est quod iuvat
memento intersit.

20
00:01:01,730 --> 00:01:04,920
Lorem sicuti est tantum
invenire smallest-- bulla

21
00:01:04,920 --> 00:01:06,790
sicuti est PERMUTO adjacent paria.

22
00:01:06,790 --> 00:01:08,710
Nos PERMUTO adjacent paria
elementorum si

23
00:01:08,710 --> 00:01:12,530
extra ordinem, quod nempe
bullae maior elementa ad dextram,

24
00:01:12,530 --> 00:01:17,060
eodemque tempore incipit
minoribu 'sunt elementis moveri ad sinistram.

25
00:01:17,060 --> 00:01:20,180
Pessimum-casu tunc temporis spatio
bulla huiusmodi n quadrat.

26
00:01:20,180 --> 00:01:23,476
Optimus-casu currit tempus
bulla generis est n.

27
00:01:23,476 --> 00:01:25,350
Quia in eo loco essetis
non actually--

28
00:01:25,350 --> 00:01:27,141
ut non sit nobis necesse
facietis aliud swaps in omnibus.

29
00:01:27,141 --> 00:01:31,026
Tantum habere, ut faciatis unum
transmarinae n elementa.

30
00:01:31,026 --> 00:01:34,600
>> In insertionem modi, in
basic idea hic varium.

31
00:01:34,600 --> 00:01:36,630
Ut enim keyword insertionem modi.

32
00:01:36,630 --> 00:01:39,630
Sumamus ingredi semel
ordinata a sinistro ad dextrum.

33
00:01:39,630 --> 00:01:41,670
Et nos sumus
iens ut sibimet elementorum

34
00:01:41,670 --> 00:01:46,260
iam diximus aperiendi
oportet alicubi minores quae fit

35
00:01:46,260 --> 00:01:48,080
retro in sorted portio.

36
00:01:48,080 --> 00:01:51,600
Sic itaque aedificavimus sorted array unum
elementum tempus, sinistro ad dextrum,

37
00:01:51,600 --> 00:01:54,740
et ad locum transferre.

38
00:01:54,740 --> 00:01:58,650
Pessimum-casu currit tempus
insertionem modi est n quadrat.

39
00:01:58,650 --> 00:02:02,380
Optimum casu currit tempus, n.

40
00:02:02,380 --> 00:02:05,380
>> Index mutationum iuribus Sort-- keyword
hic diffissus merge.

41
00:02:05,380 --> 00:02:08,949
Scinditur ut totam aciem an
suus 'sex, octo elementa,

42
00:02:08,949 --> 00:02:13,790
10,000 elements-- nos scindendae eam
per dimidium duplo duplo

43
00:02:13,790 --> 00:02:17,720
quoadusque signemus servos Dei sub array
n unum elementum vestit.

44
00:02:17,720 --> 00:02:19,470
A set of n unum elementum vestit.

45
00:02:19,470 --> 00:02:22,640
Sic nos coepi per unum
1,000-elementum ordinata,

46
00:02:22,640 --> 00:02:26,550
et ad punctum ubi
habent 1,000 unum elementum vestit.

47
00:02:26,550 --> 00:02:30,990
Tunc incipietis merge sub illis vestit
pariter remeabamus in recto ordine.

48
00:02:30,990 --> 00:02:34,860
Ita dempti sunt palmi duo unum-elementum vestit
quod partum a duo-elementum ordinata.

49
00:02:34,860 --> 00:02:38,180
Moles duas accipiamus duo-elementum vestit
quod partum a quattuor-elementum ordinata

50
00:02:38,180 --> 00:02:43,900
et cetera usque habuimus
iterum aedificetur n elementum ordinata.

51
00:02:43,900 --> 00:02:48,410
>> Pessimum-casu currit tempus
merge sort est n vicibus log n.

52
00:02:48,410 --> 00:02:52,390
N elementis habemus, sed
hoc processu recombining

53
00:02:52,390 --> 00:02:56,960
legium log n gressus impetro
respexerunt ad ordinata.

54
00:02:56,960 --> 00:03:01,160
Quod optimum est currere tempore log
non tamen propter hoc n

55
00:03:01,160 --> 00:03:04,090
curat an veris an ordinata fuit
vel fringilla ante.

56
00:03:04,090 --> 00:03:07,590
Processus idem illic
quae nullo modo paululum alis.

57
00:03:07,590 --> 00:03:11,610
Et maxime in casu n log n,
n log n in causa optima.

58
00:03:11,610 --> 00:03:13,960
>> Locuti sumus circa duo
scrutantes algorithms.

59
00:03:13,960 --> 00:03:16,230
Ita est de linearibus search iterating.

60
00:03:16,230 --> 00:03:19,500
Procedimus trans array
simul ab sinistro ad dextrum,

61
00:03:19,500 --> 00:03:21,950
conatur invenire numerum
quod nos 'vultus pro.

62
00:03:21,950 --> 00:03:24,550
Pessimum-casu currit tempus magnus O n.

63
00:03:24,550 --> 00:03:27,610
Tenuisti nobis iterando
per singula

64
00:03:27,610 --> 00:03:30,660
Elementum quaerimus invenire
quia vel in ultimo gradu,

65
00:03:30,660 --> 00:03:31,630
aut omnino non acceperant.

66
00:03:31,630 --> 00:03:34,720
Non possumus, donec confirmare
weve omnia respexit.

67
00:03:34,720 --> 00:03:36,730
m maxime casu statim invenietis.

68
00:03:36,730 --> 00:03:41,060
Optimus-casu currit tempus
I et omega quaestionis.

69
00:03:41,060 --> 00:03:43,689
>> Denique factum est binariae search,
quae requirit confusaque ordinata.

70
00:03:43,689 --> 00:03:45,605
Memento quod valde
maximus considerationem

71
00:03:45,605 --> 00:03:47,155
cum cooperante binariae search.

72
00:03:47,155 --> 00:03:50,180
Suus 'a praeexigitur ad usura it--
in aciem per quem quaeritis

73
00:03:50,180 --> 00:03:52,160
oportet sorted.

74
00:03:52,160 --> 00:03:54,500
Secus concredantur keyword
et partitus est vincere.

75
00:03:54,500 --> 00:03:58,310
Scindes array in dimidia et
eliminare dimidium elementorum

76
00:03:58,310 --> 00:04:00,780
omni tempore ut procedant.

77
00:04:00,780 --> 00:04:04,330
Propter hoc dividere et vincere
et illas quae in media ubi appropinquare cognovit,

78
00:04:04,330 --> 00:04:07,450
pessimus-casu currit tempus
de binariae search est

79
00:04:07,450 --> 00:04:11,730
log n, quod est substantialiter
melius quam linearibus search s n.

80
00:04:11,730 --> 00:04:13,570
Unum etiam optimus-casu currit tempus.

81
00:04:13,570 --> 00:04:17,010
>> Nos posset invenire eam statim
Prima divisio temporis, sed

82
00:04:17,010 --> 00:04:19,339
iterum, memores estote quod aliquando
quamvis binariae search est

83
00:04:19,339 --> 00:04:24,030
substantialiter melius quam linearibus search
ex eo quod sint versus n log n,

84
00:04:24,030 --> 00:04:27,110
opus ire per circuitum ne effundatur
of voluptua vestra array primum, qui

85
00:04:27,110 --> 00:04:32,010
ut faceret illud secundum minus efficax
in magnitudine iterating sorted.

86
00:04:32,010 --> 00:04:35,250
>> Lloyd doug sum hoc CS50.

87
00:04:35,250 --> 00:04:36,757