You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
62 lines
1.6 KiB
62 lines
1.6 KiB
// File: binary_search_test.go
|
|
// Created Time: 2022-12-05
|
|
// Author: Slone123c (274325721@qq.com)
|
|
|
|
package chapter_searching
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
func TestBinarySearch(t *testing.T) {
|
|
var (
|
|
target = 6
|
|
nums = []int{1, 3, 6, 8, 12, 15, 23, 26, 31, 35}
|
|
expected = 2
|
|
)
|
|
// 在陣列中執行二分搜尋
|
|
actual := binarySearch(nums, target)
|
|
fmt.Println("目標元素 6 的索引 =", actual)
|
|
if actual != expected {
|
|
t.Errorf("目標元素 6 的索引 = %d, 應該為 %d", actual, expected)
|
|
}
|
|
}
|
|
|
|
func TestBinarySearchEdge(t *testing.T) {
|
|
// 包含重複元素的陣列
|
|
nums := []int{1, 3, 6, 8, 12, 15, 23, 26, 31, 35}
|
|
fmt.Println("\n陣列 nums = ", nums)
|
|
|
|
// 二分搜尋左邊界和右邊界
|
|
for _, target := range []int{6, 7} {
|
|
index := binarySearchLeftEdge(nums, target)
|
|
fmt.Println("最左一個元素", target, "的索引為", index)
|
|
|
|
index = binarySearchRightEdge(nums, target)
|
|
fmt.Println("最右一個元素", target, "的索引為", index)
|
|
}
|
|
}
|
|
|
|
func TestBinarySearchInsertion(t *testing.T) {
|
|
// 無重複元素的陣列
|
|
nums := []int{1, 3, 6, 8, 12, 15, 23, 26, 31, 35}
|
|
fmt.Println("陣列 nums =", nums)
|
|
|
|
// 二分搜尋插入點
|
|
for _, target := range []int{6, 9} {
|
|
index := binarySearchInsertionSimple(nums, target)
|
|
fmt.Println("元素", target, "的插入點的索引為", index)
|
|
}
|
|
|
|
// 包含重複元素的陣列
|
|
nums = []int{1, 3, 6, 6, 6, 6, 6, 10, 12, 15}
|
|
fmt.Println("\n陣列 nums =", nums)
|
|
|
|
// 二分搜尋插入點
|
|
for _, target := range []int{2, 6, 20} {
|
|
index := binarySearchInsertion(nums, target)
|
|
fmt.Println("元素", target, "的插入點的索引為", index)
|
|
}
|
|
}
|