网络释义专业释义英英释义
合并排序法 (insertion sort) 的 time bound 为: T( n ) = T( n/2 ) + T( n/2 ) + cn = O( n lg n )
基于1个网页-相关网页
list insertion sort 表插入排序
shared insertion sort 共享插入排序
Binary Insertion Sort 折半插入排序
merge insertion sort 归并插入排序
Direct Insertion Sort 直接插入排序
straight insertion sort 直接插入排序
Including Insertion Sort 其中包括插入排序
multiple list insertion sort 多表插入排序
sort by insertion 插入排序
Insertion sort
- abstract: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
以上来源于: WordNet
原声例句
-
Insertion sort or bubble sort?
插入排序还是冒泡排序？
-
So the first one here is something called insertion sort which amounts to going through the list, taking the first thing that you see and inserting that element into its correct place, - then moving on to the next one, dealing with what element-- whatever element you're given and putting it in its right place.
首先是插入排序,在此算法中，需要遍历整个列表,将你遇到的第一个元素放在其正确的位置，然后移动到下一个元素，继续处理-,不管是什么元素,都将其插入到合适的位置。
-
All right. Now an insertion, sort of discursus.
好了,现在咱们来个小讨论
应用推荐