Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Optimize power() using exponentiation by squaring (O(log n))#7069

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Open
Vinayak-v12 wants to merge3 commits intoTheAlgorithms:master
base:master
Choose a base branch
Loading
fromVinayak-v12:optimize-power-method

Conversation

@Vinayak-v12
Copy link

This PR optimizes the power() method by replacing the linear recursive
implementation with an exponentiation-by-squaring approach.

✔ Time complexity reduced from O(n) → O(log n)
✔ Handles negative exponents
✔ Keeps same behavior as original implementation
✔ Fully compatible with existing test cases
✔ No API changes

This improves performance and reduces recursion depth while maintaining clean readability.

@codecov-commenter
Copy link

codecov-commenter commentedNov 15, 2025•
edited
Loading

Codecov Report

❌ Patch coverage is87.50000% with1 line in your changes missing coverage. Please review.
✅ Project coverage is 78.33%. Comparing base (a008cc2) to head (0537442).

Files with missing linesPatch %Lines
...a/com/thealgorithms/maths/PowerUsingRecursion.java87.50%0 Missing and 1 partial⚠️
Additional details and impacted files
@@            Coverage Diff            @@##             master    #7069   +/-   ##=========================================  Coverage     78.33%   78.33%- Complexity     6670     6672    +2=========================================  Files           753      753             Lines         22185    22192    +7       Branches       4356     4359    +3     =========================================+ Hits          17378    17384    +6  Misses         4107     4107- Partials        700      701    +1

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report?Share it here.

🚀 New features to boost your workflow:
  • ❄️Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

@DenizAltunkapan
Copy link
Member

Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment

Reviewers

@DenizAltunkapanDenizAltunkapanAwaiting requested review from DenizAltunkapanDenizAltunkapan is a code owner

@yanglbmeyanglbmeAwaiting requested review from yanglbmeyanglbme is a code owner

@alxkmalxkmAwaiting requested review from alxkmalxkm is a code owner

At least 1 approving review is required to merge this pull request.

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

3 participants

@Vinayak-v12@codecov-commenter@DenizAltunkapan
[8]ページ先頭
©2009-2025 Movatter.jp