Assertion: algorithm | /r/CapableOf | search unordered list
Facets:
value: for a marked entry
type: PURPOSE
value: with n entries
type: OTHER
Source sentences:
text: Grover's algorithm searches an unstructured database (or an unordered list) with N entries, for a marked entry, using only O ( N ) {\displaystyle O({\sqrt {N}})} queries instead of the O ( N ) {\displaystyle O({N})} queries required classically.