AI coding assistant for busy programmers

All

JavaScript

Difference between a stable and unstable sorting algorithm in Go

Go

package main

import (
	"fmt"
	"sort"
)

type Person struct {
	Name string  // Name of the person.
	Age  int     // Age of the person.
}

// ByAge implements sort.Interface for []Person based on the Age field.  This is a stable sorting algorithm.  The original order of elements with equal values is preserved.   This is a stable sorting algorithm.   The original order of elements with equal values is preserved.   This is a stable sorting algorithm.   The original order of elements with equal values is preserved.   This is a stable sorting algorithm.   The original order of elements with equal values is preserved.   This is a stable sorting algorithm.   The original order of elements with equal values is preserved.    This is a stable sorting algorithm.   The original order of elements with equal values is preserved.    This is a stable sorting algorithm.   The original order of elements with equal values is preserved..    This is a stable sorting algorithm..    This is a stable sorting algorithm..    This is a stable sorting algorithm..    This i

🤖 Code Explanation

type ByAge []Person

func (a ByAge) Len() int { return len(a) }
func (a ByAge) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a ByAge) Less(i, j int) bool { return a[i].Age < a[j].Age }

func main() {
people := []Person{
{"Bob", 31},
{"John", 42},
{"Michael", 17},
{"Jenny", 26},
}

fmt.Println(people)
sort.Sort(ByAge(people))
fmt.Println(people)
}

This code sorts a slice of People by age using Go's built-in sort package.

AI coding assistant for busy programmers

Difference between a stable and unstable sorting algorithm in Go

Go

🤖 Code Explanation

More problems solved in Go