用二叉树实现插入排序

二叉树插入排序:

package treesort_test

import (
	"fmt"
	"math/rand"
	"sort"
	"testing"

	"gopl.io/ch4/treesort"
)

func TestSort(t *testing.T) {
	var arr [8]int = [8]int{2, 10, 8, 5, 30, 4, 7, 9}
	treesort.Sort(arr[0:8])
	fmt.Println(arr)

	data := make([]int, 50)
	for i := range data {
		data[i] = rand.Int() % 50
	}
	treesort.Sort(data)
	if !sort.IntsAreSorted(data) {
		t.Errorf("not sorted: %v", data)
	}
}

输出结果：

=== RUN TestSort

[2 4 5 7 8 9 10 30]

--- PASS: TestSort (0.00s)

PASS

ok gopl.io/ch4/treesort 0.611s