Home Backend Development Golang How to sort in golang

How to sort in golang

May 22, 2023 pm 01:18 PM

Golang is a modern programming language that has been widely used in many fields through its concurrency capabilities and efficient memory management. In golang, sorting is one of the common operations, and the sorting algorithm is also a relatively basic data structure and algorithm.

Golang provides some built-in sorting functions, such as the common sort.Ints in the sort package, which can sort integer slices. Additionally, we can also use sort.Strings to sort string slices. But in some scenarios, we need to write our own sorting function to meet specific sorting requirements. In this case, we need to understand the sorting algorithm and the sorting method provided by golang.

  1. Built-in sorting function

The sorting functions provided in golang are very convenient. For example, sort.Ints and sort.Strings provided by the sort package are very common. The following is an example of using sort.Ints for sorting:

package main

import (
    "fmt"
    "sort"
)

func main() {
    nums := []int{3, 2, 1, 4, 5, 7, 6}
    sort.Ints(nums)
    fmt.Println(nums)
}
Copy after login

The output result is: [1 2 3 4 5 6 7]

We can also use sort.Strings to sort strings :

package main

import (
    "fmt"
    "sort"
)

func main() {
    strs := []string{"a", "c", "b", "d", "f", "e"}
    sort.Strings(strs)
    fmt.Println(strs)
}
Copy after login

The output result is: [a b c d e f]

  1. Bubble sort algorithm

Bubble sort is a basic sorting algorithm and a comparison Easy to understand and implement. The basic principle is to compare adjacent elements, and swap positions if the order is wrong. After one round of sorting, the maximum or minimum value will reach the end of the sequence, and this process is repeated until all elements are in order. The following is the bubble sort algorithm implemented using go:

package main

import "fmt"

func bubbleSort(nums []int) {
    for i := len(nums)-1; i > 0; i-- {
        for j := 0; j < i; j++ {
            if nums[j] > nums[j+1] {
                nums[j], nums[j+1] = nums[j+1], nums[j]
            }
        }
    }
}

func main() {
    nums := []int{3,2,1,4,5,7,6}
    bubbleSort(nums)
    fmt.Println(nums)
}
Copy after login

The output result is: [1 2 3 4 5 6 7]

  1. Quick sort algorithm

Quick sort is another common sorting algorithm. The basic principle is to divide the sequence to be sorted into two parts through one sorting. One part is smaller than the reference element, the other part is larger than the reference element, and then the two parts are quickly processed separately. Sort and finally get an ordered sequence. In the Go language, quick sorting is also relatively easy to implement. The code is as follows:

package main

import "fmt"

func quickSort(nums []int) []int {
    if len(nums) <= 1 {
        return nums
    }

    pivot := nums[0]
    var left, right []int
    for _, num := range nums[1:] {
        if num < pivot {
            left = append(left, num)
        } else {
            right = append(right, num)
        }
    }

    left = quickSort(left)
    right = quickSort(right)

    return append(append(left, pivot), right...)
}

func main() {
    nums := []int{3, 2, 1, 4, 5, 7, 6}
    nums = quickSort(nums)
    fmt.Println(nums)
}
Copy after login

The output result is: [1 2 3 4 5 6 7]

  1. Merge sort algorithm

Merge sort is another relatively fast sorting algorithm. The basic principle is to divide the sequence to be sorted into two sequences, sort them separately and then merge them. Compared with the quick sort algorithm, merge sort does not require element exchange, so it can achieve "stable" sorting results. In golang, we can use recursion to implement the merge sort algorithm. The code is as follows:

package main

import "fmt"

func mergeSort(nums []int) []int {
    if len(nums) <= 1 {
        return nums
    }

    mid := len(nums) / 2
    left, right := nums[:mid], nums[mid:]

    left = mergeSort(left)
    right = mergeSort(right)

    return merge(left, right)
}

func merge(left, right []int) []int {
    merged := make([]int, 0, len(left)+len(right))

    for len(left) > 0 && len(right) > 0 {
        if left[0] <= right[0] {
            merged = append(merged, left[0])
            left = left[1:]
        } else {
            merged = append(merged, right[0])
            right = right[1:]
        }
    }

    merged = append(merged, left...)
    merged = append(merged, right...)

    return merged
}

func main() {
    nums := []int{3, 2, 1, 4, 5, 7, 6}
    nums = mergeSort(nums)
    fmt.Println(nums)
}
Copy after login

The output result is: [1 2 3 4 5 6 7]

Summary:

In golang, we can use the built-in sort function to perform basic sorting operations. For some more complex sorting requirements, we can choose the corresponding sorting algorithm to implement according to the specific situation. Common sorting algorithms include bubble sort, quick sort and merge sort. When implementing, attention should be paid to the complexity and stability of the algorithm.

The above is the detailed content of How to sort in golang. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

AI Hentai Generator

AI Hentai Generator

Generate AI Hentai for free.

Hot Article

R.E.P.O. Energy Crystals Explained and What They Do (Yellow Crystal)
2 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
Repo: How To Revive Teammates
4 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
Hello Kitty Island Adventure: How To Get Giant Seeds
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

Go language pack import: What is the difference between underscore and without underscore? Go language pack import: What is the difference between underscore and without underscore? Mar 03, 2025 pm 05:17 PM

This article explains Go's package import mechanisms: named imports (e.g., import &quot;fmt&quot;) and blank imports (e.g., import _ &quot;fmt&quot;). Named imports make package contents accessible, while blank imports only execute t

How to implement short-term information transfer between pages in the Beego framework? How to implement short-term information transfer between pages in the Beego framework? Mar 03, 2025 pm 05:22 PM

This article explains Beego's NewFlash() function for inter-page data transfer in web applications. It focuses on using NewFlash() to display temporary messages (success, error, warning) between controllers, leveraging the session mechanism. Limita

How to convert MySQL query result List into a custom structure slice in Go language? How to convert MySQL query result List into a custom structure slice in Go language? Mar 03, 2025 pm 05:18 PM

This article details efficient conversion of MySQL query results into Go struct slices. It emphasizes using database/sql's Scan method for optimal performance, avoiding manual parsing. Best practices for struct field mapping using db tags and robus

How can I define custom type constraints for generics in Go? How can I define custom type constraints for generics in Go? Mar 10, 2025 pm 03:20 PM

This article explores Go's custom type constraints for generics. It details how interfaces define minimum type requirements for generic functions, improving type safety and code reusability. The article also discusses limitations and best practices

How do I write mock objects and stubs for testing in Go? How do I write mock objects and stubs for testing in Go? Mar 10, 2025 pm 05:38 PM

This article demonstrates creating mocks and stubs in Go for unit testing. It emphasizes using interfaces, provides examples of mock implementations, and discusses best practices like keeping mocks focused and using assertion libraries. The articl

How to write files in Go language conveniently? How to write files in Go language conveniently? Mar 03, 2025 pm 05:15 PM

This article details efficient file writing in Go, comparing os.WriteFile (suitable for small files) with os.OpenFile and buffered writes (optimal for large files). It emphasizes robust error handling, using defer, and checking for specific errors.

How do you write unit tests in Go? How do you write unit tests in Go? Mar 21, 2025 pm 06:34 PM

The article discusses writing unit tests in Go, covering best practices, mocking techniques, and tools for efficient test management.

How can I use tracing tools to understand the execution flow of my Go applications? How can I use tracing tools to understand the execution flow of my Go applications? Mar 10, 2025 pm 05:36 PM

This article explores using tracing tools to analyze Go application execution flow. It discusses manual and automatic instrumentation techniques, comparing tools like Jaeger, Zipkin, and OpenTelemetry, and highlighting effective data visualization

See all articles