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.

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

new Task059. #381

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

new Task059. #381

wants to merge 1 commit into from

Conversation

dmassoo
Copy link

@dmassoo dmassoo commented Nov 6, 2020

Task on counting sort algorithm.

*
* <p>
* Given a list of integers. Every number is > 0 and < 10.
* Need to sort the sequence. Algorithm complexity must be O(n).
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Could you please a test that checks the complexity?

@aabarmin
Copy link
Owner

How is it going? Do you have any ideas on how to implement this?

@dmassoo
Copy link
Author

dmassoo commented Nov 16, 2020 via email

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants