Question

How to find the Kth smallest number in an unsorted slice in Go

Answer 1

package main

import (
    "fmt"
    "sort"
)

func findKthSmallestNumber(arr []int, k int) int {
    sort.Ints(arr)
    
    return arr[k - 1]
}

func main() {
    arr := []int{42, 90, 21, 30, 37, 81, 45}
    k := 3

    result := findKthSmallestNumber(arr, k)
    fmt.Println(result) 
}




/*
run:

37

*/

 

70+ SQL courses for beginners and professionals