Challenge 2 — Solution

Task: Write a function minMax(numbers ...int) (min, max int) using
named return values and a naked return, that finds the smallest and
largest values among any number of arguments. Call it with at least
5 numbers.

package main

import "fmt"

func minMax(numbers ...int) (min, max int) {
	min = numbers[0]
	max = numbers[0]

	for _, n := range numbers {
		if n < min {
			min = n
		}
		if n > max {
			max = n
		}
	}

	return
}

func main() {
	low, high := minMax(7, 2, 19, 4, 11)
	fmt.Println(low, high)
}


Expected output:

2 19

Notes:
- min and max are pre-declared by the named return values in the
  function signature, both starting at their zero value (0) until
  explicitly set to numbers[0] on the first line.
- The bare "return" at the end is a naked return — it automatically
  sends back whatever min and max currently hold, with no need to
  write "return min, max" explicitly.
- numbers ...int collects all 5 arguments into a single slice,
  exactly like a JavaScript rest parameter — minMax would work
  identically with 2 numbers or 20.