algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 14:18:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(time-complexity): fixed some careless mistakes

Browse Source
This commit is contained in:
Cathay
2022-12-13 17:44:25 +08:00
parent f2ef38c618
commit fd4a519c6f
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/go/chapter_computational_complexity/time_complexity_types.go
View File

@ -117,7 +117,7 @@ func linearLogRecur(n float32) int {
return count return count
} }
/* 阶乘阶（递归实现） */ // factorialRecur 阶乘阶（递归实现）
func factorialRecur(n int) int { func factorialRecur(n int) int {
if n == 0 { if n == 0 {
return 1 return 1

4
docs/chapter_computational_complexity/time_complexity.md
View File

@ -116,7 +116,7 @@ $$
```java title="" ```java title=""
// 算法 A 时间复杂度：常数阶 // 算法 A 时间复杂度：常数阶
void algorithm_A(n int) { void algorithm_A(int n) {
System.out.println(0); System.out.println(0);
} }
// 算法 B 时间复杂度：线性阶 // 算法 B 时间复杂度：线性阶
@ -1432,7 +1432,7 @@ $$
=== "Go" === "Go"
```go title="time_complexity_types.go" ```go title="time_complexity_types.go"
/* 阶乘阶（递归实现） */ // factorialRecur 阶乘阶（递归实现）
func factorialRecur(n int) int { func factorialRecur(n int) int {
if n == 0 { if n == 0 {
return 1 return 1