First Sort data structure

main.go

package main
import "fmt"

func push(arr *[]int, elements... int) {
  for i, v := range elements {
    fmt.Println(i)
    if len(*arr) <= 0 {
       *arr = append(*arr, v)
    } else {
      a := *arr
      f := a[0]

      if v > f {
        a := *arr
        a[0] = v
        *arr = append(*arr, f)
      } else {
        *arr = append(*arr, v)
      }
    }
  }
}

func main() {
  a := make([]int, 0)
  push(&a, 1, 5, 10, 2, 33, 0, 0, 2, 10, 150, 2, 4, 1 ,53, 63)

  fmt.Println("-----")
  push(&a, 5, 150, 400, 2, 3, 4)

    fmt.Println("-----")
  push(&a, 500)
  
    fmt.Println(a)
}

```
 go build
 ./main
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
-----
0
1
2
3
4
5
-----
0

[500 1 5 2 10 0 0 2 10 33 2 4 1 53 63 5 150 150 2 3 4 400]

```