How to delete a foreach and reduce complexity in a go algorithme

Question

I\'am trying to implement a custom sort, a schema of my probleme :

schema

Here my current sort function :

func (input Input) Sort() *[]string {