[OTHER] updating sort algorithm parameters to Generic type <T>

[Tabbygray]

What would you like to share?

in [sorts] package, algorithms offer .sort() function. most of them has input parameter as generic type Comparable<T>, but some of them supports int[ ] only.

※algorithms that sort int[ ] only = [BinaryInsertionSort, BucketSort, DNFSort, OddEvenSort, PigeonHoleSort, RadixSort] exception : beadsort (algorithm cannot sort negative int / String sort)

how do you think about updating algorithm's parameter type to Generic type <T>?

Additional information

No response

[github-actions[bot]]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[siriak]

I think we should do that because comparability is everything they need to work

[Regyl]

@siriak I'd like to do that, could you assign to me?

[github-actions[bot]]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!