Assertion: algorithm's operation | /r/HasProperty | o(log n
Facets:
Source sentences:
text: When only the minimum (or maximum) is needed, a good approach is to use a heap, which is able to find the minimum (or maximum) element in constant time, while all other operations, including insertion, are O(log n) or better.