gods VS Go

for len(stack) > 0 { n := len(stack) - 1 // Top element fmt.Print(stack[n]) stack = stack[:n] // Pop } ``` Another solution would be to import a package like https://github.com/emirpasic/gods

What is the goal of this project? A learning exercise? There are many fairly matured solutions already available like https://github.com/emirpasic/gods. It also does not look implemented effectively. For example Stack uses for its push/pop operations costly List methods.

Doesn't say why it's here instead of trying to get into GoDS or something else.

I've found GoDS (https://github.com/emirpasic/gods) but it is not using generics, it's using "interface{}" as a type for everything.

You may want to try this implementation

https://the-algorithms.com/language/go and code that goes with it: https://github.com/TheAlgorithms/Go. I was reviewing some algo theory a while back and ended up just creating a java project with my own implementation of heap, tree traversals and so on. It's a really simple way to try to get familiar with some core concepts of any language. Just food for thought. Also all the exercises are pretty self contained. Eventually you most likely want to go beyond this but it'll get your feet wet.

I followed your link to This.

https://github.com/TheAlgorithms/Go https://github.com/Workiva/go-datastructures https://github.com/ua-nick/Data-Structures-and-Algorithms

GO: https://github.com/TheAlgorithms/Go/blob/master/sort/mergesort.go

View on GitHub

TheAlgorithms/Go (Go): Algorithms Implemented in GoLang