TIL: Sorting in Go

- 1 min


Searching and sorting are common algorithms in software. My recent journey into Golang and Christmas-themed algorithms has involved exploring both concepts and their implementations. One of my favorite features of Go has been the high quality built-in packages (namely testing and net/http), and Go’s sort package is no exception.


We can sort any data type in Go using the sort package. For example, we have an array of integers named s. A call to sort.Ints() will sort s using quicksort.

s := []int{4, 2, 3, 1}
fmt.Println(s) // [1 2 3 4]

A similar function call could be made to sort an array of strings:

s := []string{"b", "a", "d", "c"}
fmt.Println(s) // ["a" "b" "c" "d"]

Both (and others for standard data types) wrap an underlying generic function called sort.Sort() which accepts an interface as input.

We can use sort.Sort() to sort custom data structures, as long as they are collections that implement the sort.Interface interface:

type Interface interface {
        // Len is the number of elements in the collection.
        Len() int
        // Less reports whether the element with
        // index i should sort before the element with index j.
        Less(i, j int) bool
        // Swap swaps the elements with indexes i and j.
        Swap(i, j int)
Randy Kinne

Randy Kinne

Software Engineer

rss facebook twitter github gitlab youtube mail spotify lastfm instagram linkedin google google-plus pinterest medium vimeo stackoverflow reddit quora quora