From 4f64a105c8aca5b6578ed74b7a7a8a4f5f202cd0 Mon Sep 17 00:00:00 2001 From: Barrett Ruth Date: Sat, 9 Nov 2024 16:06:16 -0500 Subject: [PATCH] feat(post): clarify constant time upper bound --- posts/algorithms/leetcode-daily.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/posts/algorithms/leetcode-daily.html b/posts/algorithms/leetcode-daily.html index c0e53c7..3a09b9d 100644 --- a/posts/algorithms/leetcode-daily.html +++ b/posts/algorithms/leetcode-daily.html @@ -176,7 +176,7 @@ 2^k-1=x\))). \(x\) and \(n\) have \(lg(x)\) and \(lg(n)\) bits respectively, so the solution is \(O(lg(x) + lg(n))\in O(log(xn))\). \(1\leq x,n\leq 1e8\), so this runtime is bounded by - \(O(log(1e8^2))=O(log(1e16))=O(16)\). + \(O(log(1e8^2))=O(log(1e16))=O(16)=O(1)\).