专业释义英英释义
-
冒泡排序 - 引用次数：2 参考来源 - 基于C程序冒泡排序算法的研究与改进—《电脑知识与技术》—2010年第8期—龙源期刊网起泡排序 - 引用次数：1 参考来源 - “C/C++与数据结构”综合课程的多媒体软件设计泡沫排序磁泡排序泡式排序浮泡分类法气泡排序法冒泡排序法
-
上推分类法冒泡分类法
-
泡沫分类气泡排序冒泡排序
·2,447,543篇论文数据，部分数据来源于NoteExpress
Bubble sort
- abstract: Bubble sort, sometimes incorrectly referred to as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
以上来源于: WordNet
双语例句原声例句权威例句
-
-
Let's try it again. Test bubble sort.
让我们再试一试吧，测试下冒泡排序。
-
Bubble sort recall is a comparison sort.
冒泡排序就是一种比较排序。
-
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.
好的，下一个最大元素又,能跑到倒数第二的位置，等等如此，好的，这称为冒泡排序,因为这个泡泡一直冒到他自己的位置。
-
How many swaps do I do in general in bubble sort, compared to selection source?
在冒泡排序中，一般要做多少次交换,对比选择排序呢？
-
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.
因此，仔细想想，选择排序也许比,冒泡排序更简单，或者这两者都差不多，只是对同一问题的不同方法而已。
应用推荐