Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upimprove the time complexity of pow function #1542
Conversation
| else if(b == 1){ | ||
| return result; | ||
| }else{ | ||
| if(b % 2 == 0){ |
deadshotsb
Oct 13, 2020
Member
The complexity is still O(n) you can think of a binary search soln.
The complexity is still O(n) you can think of a binary search soln.
Describe your change:
References
Checklist:
Fixes: #{$ISSUE_NO}.