Golang 函数的性能分析与优化技巧

func linearSearch(arr []int, target int) int {
    for i := range arr {
        if arr[i] == target {
            return i
        }
    }
    return -1
}

func binarySearch(arr []int, target int) int {
    low, high := 0, len(arr)-1

    for low <= high {
        mid := (low + high) / 2
        if arr[mid] > target {
            high = mid - 1
        } else if arr[mid] < target {
            low = mid + 1
        } else {
            return mid
        }
    }

    return -1
}

const size = 100000

func main() {
    arr := make([]int, size)
    for i := 0; i < size; i++ {
        arr[i] = rand.Intn(size)
    }

    test := testing.Benchmark(func(b *testing.B) {
        for i := 0; i < b.N/size; i++ {
            _ = linearSearch(arr, rand.Intn(size))
        }
    })

    fmt.Println("Linear Search:", test)

    test = testing.Benchmark(func(b *testing.B) {
        sort.Ints(arr)
        for i := 0; i < b.N/size; i++ {
            _ = binarySearch(arr, rand.Intn(size))
        }
    })

    fmt.Println("Binary Search:", test)
}

BenchmarkLinearSearch-12          1965531         619.3 ns/op
BenchmarkBinarySearch-12        3777123         335.9 ns/op