Skip to content
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

Chapter 1 Is_unique.cc : function isUniqueChars_noDS runs in O(n^2) instead of O(n logn) #44

Open
zaffnet opened this issue Oct 5, 2017 · 0 comments
Open

Chapter 1 Is_unique.cc : function isUniqueChars_noDS runs in O(n^2) instead of O(n logn) #44

zaffnet opened this issue Oct 5, 2017 · 0 comments

Comments

@zaffnet
Copy link

zaffnet commented Oct 5, 2017

As Hint #132 suggests, isUniqueChars_noDS can be implemented in O(n logn) by sorting. Also, inside main(), the function isUniqueChars_noDS is not tested while the function isUniqueChars_bitvector is tested twice.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@zaffnet