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

[Algo] Counting Sort [C++] #299

Closed
paawan01 opened this issue Oct 5, 2018 · 3 comments · Fixed by #378
Closed

[Algo] Counting Sort [C++] #299

paawan01 opened this issue Oct 5, 2018 · 3 comments · Fixed by #378

Comments

@paawan01
Copy link

paawan01 commented Oct 5, 2018

https://en.wikipedia.org/wiki/Counting_sort

@paawan01
Copy link
Author

paawan01 commented Oct 5, 2018

Realised while implementing radix sort that counting sort also doesn't exist for this repo.
@sangamcse Can you assign this to me ?

@sangamcse
Copy link
Member

GitMate.io thinks possibly related issues are #258 ([Algo] Merge Sort [C++]), #250 ([Algo] Quick Sort [C++]), #62 ([Algo] Insertion Sort [C++]), #20 ([Algo]: Add Bubble Sort in C++), and #222 ([Algo] Radix Sort [C++]).

@koderproxy
Copy link

can i take this issue

paawan01 pushed a commit to paawan01/Algorithms that referenced this issue Oct 7, 2018
This adds Counting sort which sorts array by counting the occurences of elements.

Closes NITSkmOS#299
sangamcse pushed a commit to paawan01/Algorithms that referenced this issue Oct 12, 2018
This adds Counting sort which sorts array by counting the occurences of elements.

Closes NITSkmOS#299
sangamcse pushed a commit that referenced this issue Oct 12, 2018
This adds Counting sort which sorts array by counting the occurences of elements.

Closes #299
sangamcse pushed a commit that referenced this issue Oct 12, 2018
This adds Counting sort which sorts array by counting the
occurences of elements.

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

Successfully merging a pull request may close this issue.

3 participants