xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-19 23:10:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(sort/search): support heap/selection_sort/binary_search_edge in go code (#521)

Browse Source 
* feat(go): support binary search edge and testcase

* feat(go): support selection sort and testcase

* feat(go): support heap sort and testcase

* Update selection_sort_test.go

* Update selection_sort.go

* Update heap_sort.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Reanon
2023-05-29 12:23:52 +08:00
committed by GitHub
parent 56a4385202
commit 5bbcb12979
6 changed files with 167 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/go/chapter_searching/binary_search_test.go
+12
View File
@@ -22,3 +22,15 @@ func TestBinarySearch(t *testing.T) {
t.Errorf("目标元素 6 的索引 = %d, 应该为 %d", actual, expected)
}
}
func TestBinarySearchEdge(t *testing.T) {
target := 6
nums := []int{1, 3, 6, 6, 6, 6, 6, 10, 12, 15}
// 二分查找最左一个元素
indexLeft := binarySearchLeftEdge(nums, target)
fmt.Println("数组中最左一个元素 6 的索引 = ", indexLeft)
// 二分查找最右一个元素
indexRight := binarySearchRightEdge(nums, target)
fmt.Println("数组中最右一个元素 6 的索引 = ", indexRight)
}