From 6f8c9a9274008f6a22da20ed86600dc5c77f8bfc Mon Sep 17 00:00:00 2001 From: arnold <zhangcheng17@meituan.com> Date: Wed, 3 Apr 2019 09:31:43 +0800 Subject: [PATCH] fix README.md --- 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 2aa672a54b..4a5032a149 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.