Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8590d7a commit d18dcd2Copy full SHA for d18dcd2
src/algorithms/math/bits/README.md
@@ -137,7 +137,7 @@ a * b can be written in the below formats:
137
```
138
139
The advantage of this approach is that in each recursive step one of the operands
140
-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
141
the operand that reduces to half on each recursive step.
142
143
> See [multiply.js](multiply.js) for further details.
0 commit comments