github.com/qiuhoude/go-web@v0.0.0-20220223060959-ab545e78f20d/algorithm/datastructures/binary_search/binary_search_test.go (about)

     1  package binary_search
     2  
     3  import "testing"
     4  
     5  func TestBSearch(t *testing.T) {
     6  	arr := []int{1, 3, 4, 5, 6, 6, 8, 8, 8, 11, 18}
     7  	i := BSearch(arr, 8)
     8  	t.Log(i)
     9  	i2 := BSearchRecusion(arr, 8)
    10  	t.Log(i2)
    11  	first := BSearchFirst(arr, 8)
    12  	t.Log("first:", first)
    13  	first2 := BSearchFirst2(arr, 8)
    14  	t.Log("first2:", first2)
    15  	last := BSearchLast(arr, 8)
    16  	t.Log("last:", last)
    17  	// 第一个大于等于
    18  	fge := BSearchFirstGeVal(arr, 8)
    19  	t.Log("fge:", fge)
    20  
    21  	fg := BSearchFirstGVal(arr, 3)
    22  	t.Log("fg:", fg)
    23  
    24  	lle := BSearchLastLeVal(arr, 8)
    25  	t.Log("lle:", lle)
    26  
    27  }
    28  
    29  func TestBSqrt(t *testing.T) {
    30  	ret := BSqrt(3, 1e-6)
    31  	t.Log(ret)
    32  	ret2 := BSqrt(0.04, 1e-6)
    33  	t.Log(ret2)
    34  }