1
00:00:00,500 --> 00:00:02,840
[Powered by Google Translate] [BULLITUS GENUS]

2
00:00:02,840 --> 00:00:04,560
[Jackson STEINKAMP Harvard University]

3
00:00:04,560 --> 00:00:07,500
[HOC EST CS50. CS50TV]

4
00:00:08,000 --> 00:00:11,730
Bullæ Sort est exemplum voluptua algorithm -

5
00:00:11,730 --> 00:00:14,460
scilicet elementa communia voluptua Ordo

6
00:00:14,460 --> 00:00:15,840
ascendendo vel descendendo ordinem.

7
00:00:15,840 --> 00:00:18,710
Nam si ex multitudine exercitu reducere voluerunt

8
00:00:18,710 --> 00:00:23,060
[III, V, II, IX] exsequendam bullam recte reddere modi

9
00:00:23,060 --> 00:00:26,260
ordo digestus [II, III, V, IX] in sursum.

10
00:00:26,260 --> 00:00:28,850
Nunc, Im 'iens explicare pseudocode quomodo algorithm officina.

11
00:00:28,850 --> 00:00:34,000
>> Aliquam sit amet dicimus voluptua indices integros V - III, II, IX, VI et V.

12
00:00:34,000 --> 00:00:37,650
Et incipit quaerere algorithm primum duo, II et III,

13
00:00:37,650 --> 00:00:40,850
de quo si nimium reprimendum et inter se.

14
00:00:40,850 --> 00:00:43,150
Sunt - quam II III.

15
00:00:43,150 --> 00:00:45,190
In ascendendo esset converso.

16
00:00:45,190 --> 00:00:46,610
Ita est PERMUTO eos.

17
00:00:46,610 --> 00:00:49,760
Sed hoc videtur ad summam [II, III, IX, VI, V].

18
00:00:49,760 --> 00:00:52,450
>> Deinde videamus secundi elementi et III IX.

19
00:00:52,450 --> 00:00:55,770
Ut inter se bene haerent.

20
00:00:55,770 --> 00:00:58,800
Id est, III minus est quam IX ita algorithm non PERMUTO eos.

21
00:00:58,800 --> 00:01:01,900
Deinde videamus VI et IX. Haerent ex ordine.

22
00:01:01,900 --> 00:01:04,260
>> Sic, nos postulo ut PERMUTO eos quia IX maior est quam VI.

23
00:01:04,260 --> 00:01:08,840
Denique spectemus duos integros, et V IX.

24
00:01:08,840 --> 00:01:10,850
Haerent ex ordine, sic debent, swapped.

25
00:01:10,850 --> 00:01:13,360
Cum transieris per omnia primae tabulae,

26
00:01:13,360 --> 00:01:17,140
alius sic: [II, III, VI, V, IX.]

27
00:01:17,140 --> 00:01:19,690
Non malus est. Suus 'fere sorted.

28
00:01:19,690 --> 00:01:22,450
Set oportet percurrere list iterum ad adepto eam omnino sorted.

29
00:01:22,450 --> 00:01:29,250
Alterum minus III, quos non ita RES.

30
00:01:29,250 --> 00:01:31,700
>> VI minus trium, et illa non RES.

31
00:01:31,700 --> 00:01:35,500
Sex maior est quam V. Nos swapped.

32
00:01:35,500 --> 00:01:38,460
Sex minus est quam IX. Nos non PERMUTO.

33
00:01:38,460 --> 00:01:42,170
Secunda transierit, quod videtur [II, III, V, VI, IX]. Perfect.

34
00:01:42,170 --> 00:01:44,680
Nunc, lets scribes in pseudocode.

35
00:01:44,680 --> 00:01:48,450
Plerumque in singulari numero, oportet considerare

36
00:01:48,450 --> 00:01:50,060
et elementum directe ad ius suum.

37
00:01:50,060 --> 00:01:53,420
Si extra ordinem inter se - id est ad sinistram elementum

38
00:01:53,420 --> 00:01:56,810
recto maior est - id est duo RES.

39
00:01:56,810 --> 00:02:01,270
>> Et hoc elementum ex omni numero, qui et acie transmittunt.

40
00:02:01,270 --> 00:02:05,160
Nunc nos iustus have efficio saltum-per satis tempora ad curare list

41
00:02:05,160 --> 00:02:06,480
est copiose, proprie sorted.

42
00:02:06,480 --> 00:02:08,889
Quotiens autem per hoc quod album

43
00:02:08,889 --> 00:02:10,400
Praestabo, erant 'fieri?

44
00:02:10,400 --> 00:02:14,730
Bene, pessimus-casu missione est si habemus perfecte retrogradus list.

45
00:02:14,730 --> 00:02:17,840
Sic autem habet plures numero, throughs

46
00:02:17,840 --> 00:02:19,730
elementorum n-I.

47
00:02:19,730 --> 00:02:24,720
Non modo si intuitive videtur quod simplici - Ordo [II, I].

48
00:02:24,720 --> 00:02:28,430
>> Haec aguntur ut tollerent unam transitis-per exstat recte.

49
00:02:28,430 --> 00:02:33,060
[III, II, I] - III pessimum habet, quod commoda quae retro

50
00:02:33,060 --> 00:02:34,830
suus 'iens accipere II iterations ad huiusmodi.

51
00:02:34,830 --> 00:02:37,980
Iterationem post suus [II, I, III.]

52
00:02:37,980 --> 00:02:39,550
Secundo praebere sorted array [I, II, III].

53
00:02:39,550 --> 00:02:43,350
Ut scias numquam ire per acies fere

54
00:02:43,350 --> 00:02:46,790
I n plus temporis in aciem, ubi n est numerum elementorum.

55
00:02:47,090 --> 00:02:50,470
Suus 'vocavit bullæ Sort quia maxima elementa tendunt ad' bulla-sursum '

56
00:02:50,470 --> 00:02:51,950
ad dexteram pulchellus cito.

57
00:02:51,950 --> 00:02:53,980
Hoc etenim algorithm habet valde interesting moribus.

58
00:02:53,980 --> 00:02:57,410
>> Post m iterations per totam apparatu,

59
00:02:57,410 --> 00:02:59,000
in rightmost m elementa sunt praestati

60
00:02:59,000 --> 00:03:01,000
ut sorted in rectam eorundem loco.

61
00:03:01,000 --> 00:03:02,280
Tu si vis videre,

62
00:03:02,280 --> 00:03:05,500
omnino summam posteriorem in conemur [IX, VI, V, III, II].

63
00:03:05,500 --> 00:03:08,220
Post unum transitis per totam album,

64
00:03:08,220 --> 00:03:09,220
[Sound scribendi]

65
00:03:09,220 --> 00:03:18,790
[VI, IX, V, III, II] [VI, V, IX, III, II] [VI, V, III, IX, II] [VI, V, III, II, IX]

66
00:03:18,790 --> 00:03:21,250
in rightmost elementum IX est in proprio loco.

67
00:03:21,250 --> 00:03:24,760
Post secundam transitis-sensit, VI habebit 'ebulliit-sursum «ad

68
00:03:24,760 --> 00:03:26,220
secundus rightmost loco.

69
00:03:26,220 --> 00:03:28,840
In dextro duo - IX et VI - sit propria loca

70
00:03:28,840 --> 00:03:30,580
post primum duo transitis-throughs.

71
00:03:30,580 --> 00:03:32,590
>> Sic, quomodo possumus nos utor is ut optimize in algorithm?

72
00:03:32,590 --> 00:03:34,850
Igitur post unum et iteratione per array

73
00:03:34,850 --> 00:03:37,690
nos non egemus, ad reprimendam rightmost elementum

74
00:03:37,690 --> 00:03:39,200
quia scimus suus 'sorted.

75
00:03:39,200 --> 00:03:43,050
Bis iterations scimus rightmost nimirum in duobus locis.

76
00:03:43,050 --> 00:03:48,260
Sic ducis iterations k per totam aciem

77
00:03:48,260 --> 00:03:51,550
tardata ultimum k elementorum est superuacua cum sciamus

78
00:03:51,550 --> 00:03:52,360
haerent in recta location iam.

79
00:03:52,360 --> 00:03:54,870
>> Quae si es, n voluptua exercitu,

80
00:03:54,870 --> 00:03:57,870
in primo iteratione - you'll habere exstat omnes elementorum - hic est primarius n-0.

81
00:03:57,870 --> 00:04:04,170
Secundo iteratione, quae te non respicias ultimum omnium -

82
00:04:04,170 --> 00:04:07,090
primum n-I.

83
00:04:07,090 --> 00:04:10,520
Alius optimization esset, ad reprimendam si album est iam sorted

84
00:04:10,520 --> 00:04:11,710
postquam quisque iterationem.

85
00:04:11,710 --> 00:04:13,900
'Iam si commoda, non amplius necesse iterations

86
00:04:13,900 --> 00:04:15,310
per album.

87
00:04:15,310 --> 00:04:16,220
Quomodo possumus hoc facere?

88
00:04:16,220 --> 00:04:19,360
Bene, si nos non facietis aliud swaps in transitis-per of album,

89
00:04:19,360 --> 00:04:22,350
suus 'patet quod list iam sorted quia non PERMUTO quicquam.

90
00:04:22,350 --> 00:04:24,160
Ita et nos certus non habent exstat iterum.

91
00:04:24,160 --> 00:04:27,960
>> Fortasse vos could initialize vexillum variabilis vocatur 'non sorted' to

92
00:04:27,960 --> 00:04:30,990
falsum et muto is ut verus si vos have PERMUTO ulla elementorum

93
00:04:30,990 --> 00:04:32,290
unum iteratione per ordinata.

94
00:04:32,290 --> 00:04:35,350
Et sic enumerat, quam multa contra swaps ut facias

95
00:04:35,350 --> 00:04:37,040
in quavis iterationem.

96
00:04:37,040 --> 00:04:40,040
In fine iteratione, si non aliquis RES elementa

97
00:04:40,040 --> 00:04:41,780
scitis album est iam sorted vestri 'fieri.

98
00:04:41,780 --> 00:04:44,090
Bullæ Sort, sicut et alia diribitio algorithms, potest esse

99
00:04:44,090 --> 00:04:46,960
tweaked operari pro cuiusquam elementi quae habent ordinatio methodo.

100
00:04:46,960 --> 00:04:50,610
>> Quod si dentur duo dici unum tibi

101
00:04:50,610 --> 00:04:53,770
maior, minor vel equalis.

102
00:04:53,770 --> 00:04:56,870
Velut a te dicens non exstat litterarum

103
00:04:56,870 --> 00:05:00,520
quod a <b, b <c etc

104
00:05:00,520 --> 00:05:03,830
Vel vos could exstat diebus hebdomadis ubi Sunday minus est quam Monday

105
00:05:03,830 --> 00:05:05,110
quod est minus quam Martis.

106
00:05:05,110 --> 00:05:09,630
>> Bullæ Sort minime est valde efficiens vel ieiunare diribitio algorithm.

107
00:05:09,630 --> 00:05:12,370
Extremo-casu runtime est Big O n ²

108
00:05:12,370 --> 00:05:14,810
quia vos have facio n iterations per a album

109
00:05:14,810 --> 00:05:18,430
reprehendo omnes n elementa singulis transitis-per, nxn = n ².

110
00:05:18,430 --> 00:05:22,730
Quod currunt secundum numerum particularum huius temporis crescat voluptua es,

111
00:05:22,730 --> 00:05:24,330
cum procursu tempus auget quadratically.

112
00:05:24,330 --> 00:05:27,330
>> Sed si efficientia est non a major cura vestri progressio

113
00:05:27,330 --> 00:05:29,550
Vestibulum voluptua si pauci tantum elementa

114
00:05:29,550 --> 00:05:31,660
vos vires reperio bullæ Sort utilis est quia

115
00:05:31,660 --> 00:05:33,360
suus 'unus a purissimis in voluptua algorithms intelligere

116
00:05:33,360 --> 00:05:34,250
et ad Codice.

117
00:05:34,250 --> 00:05:37,270
Phasellus ut magna et interpretatione in usum theoretice

118
00:05:37,270 --> 00:05:40,220
algorithm in actuali fungentia code.

119
00:05:40,220 --> 00:05:43,000
Bene, ut 'bullæ Sort pro vobis. Gratias agens pro vigilantem.

120
00:05:43,000 --> 00:05:44,000
CS50.TV