insert_into_sorted.go

package main

import "fmt"

func main() {
	items := []int{}
	item := 2
  
    	var (
        	begin int 
        	end   int = len(items)
        	i     int 
    	)
	for {
		if (begin == end) {
			n := make([]int, end, len(items)+1)
			copy(n, items[:end])
			n = append(n, item)
			n = append(n, items[end:]...)
			fmt.Println(n)
			return
		}
		
		i = begin + (end - begin) / 2
		fmt.Println(i)
		
		pivot := items[i]
		if item < pivot {
			fmt.Println("end=", i)
			end = i
		} else {
			fmt.Println("begin=", i+1)
			begin = i+1
		}
	}
}