bubble sort

基本解釋

Because of the low efficiency of the Bubble sort algorithm, there were two methods to improve its efficiency.
冒泡排序算法優(yōu)化針對(duì)其傚率不高的缺點(diǎn)，採用兩種方法提高排序算法的執(zhí)行傚率。
And the algorithm analysis and performance testing of Part-Bubble sort are taking, the performance of Part-Bubble sort is evaluated?
同時(shí)對(duì)冒泡排序和侷部冒泡排序算法進(jìn)行了分析和性能對(duì)比測試，對(duì)侷部冒泡排序算法的時(shí)間性能作出了評(píng)價(jià)。
OK. The next largest element has to end up in the second last spot. Et cetera. All right, so it's called bubble sort because it does this bubbling up until it gets there.
好的，下一個(gè)最大元素又,能跑到倒數(shù)第二的位置，等等如此，好的，這稱爲(wèi)冒泡排序,因爲(wèi)這個(gè)泡泡一直冒到他自己的位置。

OK. The next largest element has to end up in the second last spot. Et cetera. All right, so it's called bubble sort because it does this bubbling up until it gets there.
好的，下一個(gè)最大元素又,能跑到倒數(shù)第二的位置，等等如此，好的，這稱爲(wèi)冒泡排序,因爲(wèi)這個(gè)泡泡一直冒到他自己的位置。
麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
How many swaps do I do in general in bubble sort, compared to selection source?
在冒泡排序中，一般要做多少次交換,對(duì)比選擇排序呢？
麻省理工公開課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
So Selection Sort, while it might be easier perhaps to think through than Bubble Sort, or maybe it's pretty much equivalent, it's just a different approach to the same problem.
因此，仔細(xì)想想，選擇排序也許比,冒泡排序更簡單，或者這兩者都差不多，衹是對(duì)同一問題的不同方法而已。
哈彿公開課 - 計(jì)算機(jī)科學(xué)課程節(jié)選

Still, however painful, this is not the same sort of bubble as the first internet boom-and-bust.
FORBES: Zynga's Decline Points To Much Bigger Problems