From d18dcd2e422b65ddaad3d48e54394824c2d9681d Mon Sep 17 00:00:00 2001 From: arnold Date: Fri, 12 Apr 2019 13:36:11 +0800 Subject: [PATCH] fix README.md (#333) --- src/algorithms/math/bits/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/algorithms/math/bits/README.md b/src/algorithms/math/bits/README.md index 4f3ad223..f4eca244 100644 --- a/src/algorithms/math/bits/README.md +++ b/src/algorithms/math/bits/README.md @@ -137,7 +137,7 @@ a * b can be written in the below formats: ``` The advantage of this approach is that in each recursive step one of the operands -reduces to half its original value. Hence, the run time complexity is `O(log(b)` where `b` is +reduces to half its original value. Hence, the run time complexity is `O(log(b))` where `b` is the operand that reduces to half on each recursive step. > See [multiply.js](multiply.js) for further details.