shellsort造句

例句与造句

1. Shellsort is adaptive sorting algorithm in that it executes faster when the input is partially sorted.
2. Please note that following all the references, I use the spelling Shellsort rather than Shell sort.
3. This is the reason that Shellsort gap sequences have a larger optimal shrink factor of about 2.2.
4. A general lower bound on an average p-pass Shellsort was established, the first advance in this problem in four decades.
5. Shellsort, discovered by Donald Shell in 1959, is a comparison sort which divides a list to be sorted into sublists and sorts them separately.
6. It's difficult to find shellsort in a sentence. 用shellsort造句挺难的
7. Also, unlike efficient sorting algorithms, Shellsort does not require use of the call stack, making it useful in embedded systems where memory is at a premium.
8. For the average running time, only the best case for a two-pass Shellsort and an upper bound on the best case for a three-pass Shellsort were established.
9. For the average running time, only the best case for a two-pass Shellsort and an upper bound on the best case for a three-pass Shellsort were established.
10. The pattern of repeated sorting passes with decreasing gaps is similar to Shellsort, but in Shellsort the array is sorted completely each pass before going on to the next-smallest gap.
11. The pattern of repeated sorting passes with decreasing gaps is similar to Shellsort, but in Shellsort the array is sorted completely each pass before going on to the next-smallest gap.
12. "Shellsort " was invented by Donald Shell in 1959 . It improves upon bubble sort and insertion sort by moving out of order elements more than one position at a time.
13. The concept behind Shellsort is that both of these algorithms perform in O ( k " n " ) time, where k is the greatest distance between two out-of-place elements.
14. The graph below shows the average number of element comparisons in various variants of Shellsort, divided by the theoretical lower bound, i . e . log 2 " N " !, where the sequence 1, 4, 10, 23, 57, 132, 301, 701 has been extended according to the formula h _ k = \ lfloor2.25 h _ { k-1 } \ rfloor.