diff --git a/codes/go/chapter_divide_and_conquer/binary_search_recur.go b/codes/go/chapter_divide_and_conquer/binary_search_recur.go
index 7953a3a6c..df1946dc0 100644
--- a/codes/go/chapter_divide_and_conquer/binary_search_recur.go
+++ b/codes/go/chapter_divide_and_conquer/binary_search_recur.go
@@ -18,7 +18,7 @@ func dfs(nums []int, target, i, j int) int {
 		// 递归子问题 f(m+1, j)
 		return dfs(nums, target, m+1, j)
 	} else if nums[m] > target {
-		// 小于则递归左半数组
+		// 大于则递归左半数组
 		// 递归子问题 f(i, m-1)
 		return dfs(nums, target, i, m-1)
 	} else {
diff --git a/zh-hant/codes/go/chapter_divide_and_conquer/binary_search_recur.go b/zh-hant/codes/go/chapter_divide_and_conquer/binary_search_recur.go
index f24aaf89d..25ac0e467 100644
--- a/zh-hant/codes/go/chapter_divide_and_conquer/binary_search_recur.go
+++ b/zh-hant/codes/go/chapter_divide_and_conquer/binary_search_recur.go
@@ -18,7 +18,7 @@ func dfs(nums []int, target, i, j int) int {
 		// 遞迴子問題 f(m+1, j)
 		return dfs(nums, target, m+1, j)
 	} else if nums[m] > target {
-		// 小於則遞迴左半陣列
+		// 大於則遞迴左半陣列
 		// 遞迴子問題 f(i, m-1)
 		return dfs(nums, target, i, m-1)
 	} else {