Skip to content

[Array] Use Binary search to check whether num is perfect squares #273

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.

Sign up for GitHub

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

Already on GitHub? Sign in to your account

Jump to bottom
Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

[Array] Use Binary search to check whether num is perfect squares #273

wants to merge 2 commits into from

Conversation

xieweiAlex
Copy link
Contributor

Use Binary search is more efficient in both time complexity and space complexity.

@xieweiAlex xieweiAlex changed the title Use Binary search to check whether num is perfect squares [Array] Use Binary search to check whether num is perfect squares Nov 3, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@xieweiAlex