Taj
Taj
Honestly, the implementation of the sorting algorithms should not be changed right now because generics are coming to GO 🔥 next year. But if you want to make the algorithms...
> We should provide support for the data type that has highest precision, `float64` in golang. That way we can guarantee support for all the data types with less precision...
In case someone wants to experiment with generics [here](https://go2goplay.golang.org) is the link to the GoTip playground to test out new features 😄 [Here's my example of bubble sort](https://go2goplay.golang.org/p/Z8xIvIIgOBh) UPDATE: Syntax...
closed in #483
Closed by mistake, we still have three sorting algorithms that need to be modified to use the generic. Heap sort, radix sort and pigeonhole sort all require some refactoring for...
> It might be on the next release Brilliant! Let me know when it's released (by closing this issue or updating it). Also let me know if I can help...
> IMO, this algorithm is too trivial. Depends on what you mean by trivial. If you look at our [Cos](https://github.com/TheAlgorithms/Go/blob/feb2246c4605f9c9b4e00a491b2930524bbda2be/math/cos.go#L10) then I don't think composing these algorithms together to make...
Mark PR's as draft when you're working on them so that maintainers don't get pinged continuously on every change 😄
Oh ok, I'll try and look into it. Will keep you posted. PS: You can close the issue if you'd like.
You don't need an assignment of issues. Feel free to open a PR and we would review it 😄