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

Bug fixes and improvements (#1472)

Browse Source 
* preorder, inorder, postorder -> pre-order, in-order, post-order

* Bug fixes

* Bug fixes

* Update what_is_dsa.md

* Sync zh and zh-hant versions

* Sync zh and zh-hant versions.

* Update performance_evaluation.md and time_complexity.md

* Add @khoaxuantu to the landing page.

* Sync zh and zh-hant versions

* Add @ khoaxuantu to the landing page of zh-hant and en versions.

* Sync zh and zh-hant versions.

* Small improvements

* @issue :  #1450 (#1453)

Fix writing "obsecure" to "obscure"

Co-authored-by: Gaya <kheliligaya@gmail.com>

* Update the definition of "adaptive sorting".

* Update n_queens_problem.md

* Sync zh, zh-hant, and en versions.

---------

Co-authored-by: Gaya-Khelili <50716339+Gaya-Khelili@users.noreply.github.com>
Co-authored-by: Gaya <kheliligaya@gmail.com>
This commit is contained in:
Yudong Jin
2024-07-30 16:56:59 +08:00
committed by GitHub
parent 89a911583d
commit c9041c5c5e
34 changed files with 79 additions and 55 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
zh-hant/codes/rust/chapter_computational_complexity/time_complexity.rs
View File

@ -113,7 +113,7 @@ fn linear_log_recur(n: i32) -> i32 {
return 1;
}
let mut count = linear_log_recur(n / 2) + linear_log_recur(n / 2);
for _ in 0..n as i32 {
for _ in 0..n {
count += 1;
}
return count;