Assertion: algorithm's time | /r/HasProperty | 2n⌊log k⌋
Facets:
Source sentences:
text: 2⌊log k⌋ comparisons), and the full problem can be solved in O(n log k) time (approximately 2n⌊log k⌋ comparisons).:119–120