冒泡排序就是一种比较排序。
让我们再试一试吧，测试下冒泡排序。
它比选择和冒泡排序，更高效，为什么呢？
It blows selection and Bubble Sorts out of the water, but why is that?
这是一个演示冒泡排序的程序。
如何摆脱闪烁在这个冒泡排序程序吗？
示例将实现一个简单的冒泡排序算法。
在冒泡排序中，一般要做多少次交换，对比选择排序呢？
How many swaps do I do in general in bubble sort, compared to selection source?
这种方法更有效比冒泡排序，但有更多的限制。
This method is much more efficient than the bubble sort, though it has more constraints.
冒泡排序在这儿显然是被拿来开玩笑了,那么原因是什么呢？
Alright, so bubble of sorts of course is being poked fun at there for what reasons?
我觉得-，那不是-，我觉得冒泡排序应该不是正确的方法。
I — I think — — That's not a — I — I think the Bubble Sort would be the wrong way to go.
好的，不管怎么样，尽管这发生了，冒泡排序的增长率是多少呢？
All right. Nonetheless, even with this change, what's the order growth for bubble sort?
这个排序算法实现起来只是略微比冒泡排序复杂一些。
This sorting algorithm is only marginally more difficult than bubble sort to implement.
它是一种基于冒泡排序的比较算法，它们有着许多共同点。
It is a comparison sort based on bubble sort with which it shares many characteristics.
数据使用指针，数组排序和冒泡排序的程序，有语法错误。
Data Sorting Program using Pointers, Arrays, and Bubble Sorting having Syntax Errors.
快速排序是交换排序的一种方法，是对过程简单的冒泡排序的一种改进算法。
Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.
说明：关于c语言中一些常见的问题的源代码，例如，冒泡排序，水仙花数，求二次方程等。
C language on some common problems of the source code, for example, bubble sort, daffodils, seeking quadratic equations, etc.
在本文中，您学习了如何使用e4x以twentyQuestions游戏的形式实现冒泡排序例程。
In this article, you learned how to use E4X to implement a bubble sorting routine in the form of a game of Twenty Questions.
因此，仔细想想，选择排序也许比，冒泡排序更简单，或者这两者都差不多，只是对同一问题的不同方法而已。
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.
因此，你必须重新开始，而且会意识到冒泡排序，或你正在使用的方法并不理想，我需要提出一种更好的方法。
And so you have to go back to the drawing board and realize Bubble Sort or whatever it is you're using just isn't enough to snuff, I need to come up with something more clever.
同时对冒泡排序和局部冒泡排序算法进行了分析和性能对比测试，对局部冒泡排序算法的时间性能作出了评价。
And the algorithm analysis and performance testing of Part-Bubble sort are taking, the performance of Part-Bubble sort is evaluated?
好的，下一个最大元素又，能跑到倒数第二的位置，等等如此，好的，这称为冒泡排序，因为这个泡泡一直冒到他自己的位置。
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.
它可以看作是是使用并行处理器，每个都用了冒泡排序，但只是起始点在列表的不同位置(所有奇数位置可做第一步)。
It can be thought of as using parallel processors, each using bubble sort but starting at different points in the list (all odd indices for the first step).
现在，大多数Rexx安装都内置了自己的排序扩展，因此可以方便地为缺少快速排序或冒泡排序的安装定义实现这些排序方法的子例程。
Most modern Rexx installations build in their own sorting extension, and it's easy to define a subroutine that implements quicksort or bubblesort for those which lack it.
这方面有一个非常著名的例子，就是使用冒泡算法排序。
The most glaring example of this is the bubble sort algorithm.
介绍了两种较为成熟的排序方法冒泡法和选择排序法，指出这两种排序方法都可在原来基础上实现双向排序。
This paper introduces two mature sorting methods: bubble sort and selection sort, and points out that these sorting methods could be used to realize the two-direction sort.
事实上，如果将所有的，比较次数加起来，我敢打赌，比起冒泡和选择排序，它最终的比较次数是相对较少的。
And in fact, if we count up all of these silly comparisons I was making verbally I bet I'm gonna be making fewer in the end than I was with bubble or with selection.
事实上，如果将所有的，比较次数加起来，我敢打赌，比起冒泡和选择排序，它最终的比较次数是相对较少的。
And in fact, if we count up all of these silly comparisons I was making verbally I bet I'm gonna be making fewer in the end than I was with bubble or with selection.
应用推荐