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

fix: Use int instead of float for the example code of log time complexity (#1164)

Browse Source 
* Use int instead of float for the example code of log time complexity

* Bug fixes

* Bug fixes
This commit is contained in:
Yudong Jin
2024-03-23 02:17:48 +08:00
committed by GitHub
parent fc8473ccfe
commit 3ea91bda99
12 changed files with 69 additions and 69 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/swift/chapter_computational_complexity/time_complexity.swift
View File

@ -88,7 +88,7 @@ func expRecur(n: Int) -> Int {
}
/* 对数阶（循环实现） */
func logarithmic(n: Double) -> Int {
func logarithmic(n: Int) -> Int {
var count = 0
var n = n
while n > 1 {
@ -99,7 +99,7 @@ func logarithmic(n: Double) -> Int {
}
/* 对数阶（递归实现） */
func logRecur(n: Double) -> Int {
func logRecur(n: Int) -> Int {
if n <= 1 {
return 0
}
@ -107,7 +107,7 @@ func logRecur(n: Double) -> Int {
}
/* 线性对数阶 */
func linearLogRecur(n: Double) -> Int {
func linearLogRecur(n: Int) -> Int {
if n <= 1 {
return 1
}
@ -158,12 +158,12 @@ enum TimeComplexity {
count = expRecur(n: n)
print("指数阶（递归实现）的操作数量 = \(count)")
count = logarithmic(n: Double(n))
count = logarithmic(n: n)
print("对数阶（循环实现）的操作数量 = \(count)")
count = logRecur(n: Double(n))
count = logRecur(n: n)
print("对数阶（递归实现）的操作数量 = \(count)")
count = linearLogRecur(n: Double(n))
count = linearLogRecur(n: n)
print("线性对数阶（递归实现）的操作数量 = \(count)")
count = factorialRecur(n: n)