Hello, and welcome back! Our journey today takes us into the sorting universe in Go. We will learn about and utilize a few of Go’s built-in sorting functions sort.Ints() and sort.Strings(), as well as other tools from the sort package. These functions significantly simplify the task of sorting data in Go. Let's get started!

Sorting refers to arranging data in a specific order, which enhances the efficiency of search or merge operations on said data. In real life, we sort books alphabetically or clothes by size. Similar concepts are applicable in programming, where sorting large lists of data for more effective analysis is a frequent practice.

Go offers the sort package that provides various methods for sorting slices of data. Let's dive into some examples.

Sorting with sort.Ints() and sort.Strings() makes sorting slices of these data types straightforward. Let's see them in action!

Sorting Slices of Integers

package main

import (
    "fmt"
    "sort"
)

func main() {
    arr := []int{4, 1, 3, 2}
    sort.Ints(arr)
    fmt.Println(arr) // Output: [1 2 3 4]
}

Sorting Slices of Strings

package main

import (
    "fmt"
    "sort"
)

func main() {
    inventory := []string{"Bananas", "Pears", "Apples", "Dates"}
    sort.Strings(inventory)
    for _, item := range inventory {
        fmt.Println(item)
    }
    // Output:
    // Apples
    // Bananas
    // Dates
    // Pears
}

As you can see, sorting in Go is just that simple!

Go allows us to define custom sorting logic using the sort.Slice() function. Let's sort a slice of students by their grades, with alphabetical sorting applied in the event of ties in grades. First, let's define the Student struct:

package main

import (
    "fmt"
    "sort"
)

type Student struct {
    Name  string
    Grade int
}

func main() {
    students := []Student{
        {"Alice", 85},
        {"Bob", 90},
        {"Charlie", 90},
    }

    // Sort students by Grade in descending order
    // If Grades are equal, sort by Name in alphabetical order
    sort.Slice(students, func(i, j int) bool {
        if students[i].Grade != students[j].Grade {
            return students[i].Grade > students[j].Grade
        }
        return students[i].Name < students[j].Name
    })

    // Print sorted students
    for _, student := range students {
        fmt.Printf("%s:%d\n", student.Name, student.Grade)
    }
    // Output:
    // Bob:90
    // Charlie:90
    // Alice:85
}

In this example, we define a comparator function to sort the students slice primarily by grades in descending order and names alphabetically in case of ties.