Assertion: merge algorithm | /r/CapableOf | sacrifice linear-time
Facets:
value: sometimes
type: TEMPORAL
Source sentences:
text: Various in-place merge algorithms have been devised, sometimes sacrificing the linear-time bound to produce an O(n log n) algorithm; see Merge sort § Variants for discussion.