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

Radix sort wrong time complexity. #49

Open
filippocrocchini opened this issue Oct 18, 2022 · 0 comments
Open

Radix sort wrong time complexity. #49

filippocrocchini opened this issue Oct 18, 2022 · 0 comments

Comments

@filippocrocchini
Copy link

"Radix sort is a linear time sorting algorithm that sort in O(n+k) time when elements are in range from 1 to k."
The time complexity is O(n*k), O(n+k) is space complexity.
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
@filippocrocchini