Golang : Sort and reverse sort a slice of integers



Tags : golang sort reverse-sort slice

Problem :

How to sort and reverse sort a slice of integers ?

Solution :

Use sort.Ints and sort.Sort functions.

 package main

 import (
 "fmt"
 "sort"
 )

 var intSlice = []int{4, 3, 2, 1, 0}

 func main() {

 fmt.Println("Original : ", intSlice[:])

 sort.Ints(intSlice)
 fmt.Println("Sort : ", intSlice)

 sort.Sort(sort.Reverse(sort.IntSlice(intSlice)))

 fmt.Println("Reverse Sort : ", intSlice)

 }

Output :

Original : [4 3 2 1 0]

Sort : [0 1 2 3 4]

Reverse Sort : [4 3 2 1 0]

NOTE : There is a 3rd party package that can be used for sorting as well. See http://godoc.org/github.com/cznic/sortutil and https://www.socketloop.com/tutorials/golang-sort-and-reverse-sort-a-slice-of-bytes on how to use the sortutil package

Affiliate :

Hire Golang Developers


  See also : Golang : Sort and reverse sort a slice of strings



Tags : golang sort reverse-sort slice

By Adam Ng

IF you gain some knowledge or the information here solved your programming problem. Please consider donating to the less fortunate or some charities that you like. Apart from donation, planting trees, volunteering or reducing your carbon footprint will be great too.


Advertisement