Signed-off-by: SeongJae Park <sj38.park@xxxxxxxxx>
---
future/QC.tex | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/future/QC.tex b/future/QC.tex
index 3b01a56..e5ff74e 100644
--- a/future/QC.tex
+++ b/future/QC.tex
@@ -1016,7 +1016,7 @@ Grover's algorithm.
and $O(n \log_2 n)$ for classic-computing search?
Hash tables do $O(n)$ and $O(1)$ respectively!!!
\QuickQuizAnswer{
- Fixed-size hash table lookup lookups are $O(n)$, not $O(1)$.
+ Fixed-size hash table lookups are $O(n)$, not $O(1)$.
And for a resizing hash table, fairness dictates that the overhead
of resizing be properly accounted for.
--
2.10.0
--
To unsubscribe from this list: send the line "unsubscribe perfbook" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
