package main
import "fmt"
func quickSort(sli []int)([]int){
if len(sli)<2{
return sli
}
return sli
}
func return_array()([4]int){
array1 :=[...]int{6,7,9,8}
return array1
}
func return_slice(arr []int)([]int){
var s1 = []int{2,1}
fmt.Printf("%T\n%T\n",s1,arr)
return s1
}
func Sort(arr []int){
for i:=0;i<len(arr);i++{
for j:=i;j<len(arr);j++{
if arr[i]>arr[j]{
arr[i],arr[j]=arr[j],arr[i]
}
}
}
}
func main () {
sIN :=[]int{1,3,4,2}
sresult :=return_slice(sIN)
fmt.Printf("%T\n",sresult)
for i:=0;i<len(sresult);i++{
fmt.Print(sresult[i]," ")
}
array1 :=return_array()
fmt.Printf("%T\n",array1)
Sort(sIN)
for i:=0;i<len(sIN);i++{
fmt.Print(sIN[i]," ")
}
}