Assertion: set | /r/HasProperty | implemented as sorted lists
Facets:
Source sentences:
text: If sets are implemented as sorted lists, for example, the naive algorithm for union(S,T) will take time proportional to the length m of S times the length n of T; whereas a variant of the list merging algorithm will do the job in time proportional to m+n.