spreadsort造句
例句與造句
- On lists of integers and floats spreadsort shows a roughly 2 7?runtime improvement for random data on various operating systems.
- Experiments were done comparing an optimized version of spreadsort to the highly optimized C + + std : : sort, implemented with introsort.
- In the case where the number of bins is at least the number of elements, spreadsort degenerates to bucket sort and the sort completes.
- The algorithm uses heuristic tests to determine whether each bin would be more efficiently sorted by spreadsort or some other classical sort algorithm, then recursively sorts the bin.
- Like other distribution-based sorts, spreadsort has the weakness that the programmer is required to provide a means of converting each element into a numeric key, for the purpose of identifying which bin it falls in.
- It's difficult to find spreadsort in a sentence. 用spreadsort造句挺難的
- In space performance, spreadsort is worse than most in-place algorithms : in its simplest form, it is not an in-place algorithm, using O ( " n " ) extra space; in experiments, about 20 % more than quicksort using a c of 4 8.