CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2024-03-31 03:53:04 +08:00
parent 87af663929
commit c23e576da4
68 changed files with 2139 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
docs/chapter_computational_complexity/iteration_and_recursion.md
View File

@@ -182,6 +182,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="iteration.rb"
[class]{}-[func]{for_loop}
```
=== "Zig"
```zig title="iteration.zig"
@@ -408,6 +414,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="iteration.rb"
[class]{}-[func]{while_loop}
```
=== "Zig"
```zig title="iteration.zig"
@@ -649,6 +661,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="iteration.rb"
[class]{}-[func]{while_loop_ii}
```
=== "Zig"
```zig title="iteration.zig"
@@ -883,6 +901,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="iteration.rb"
[class]{}-[func]{nested_for_loop}
```
=== "Zig"
```zig title="iteration.zig"
@@ -1112,6 +1136,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="recursion.rb"
[class]{}-[func]{recur}
```
=== "Zig"
```zig title="recursion.zig"
@@ -1318,8 +1348,9 @@ comments: true
=== "Kotlin"
```kotlin title="recursion.kt"
/* Kotlin tailrec 关键词使函数实现尾递归优化 */
/* 尾递归 */
tailrec fun tailRecur(n: Int, res: Int): Int {
// 添加 tailrec 关键词，以开启尾递归优化
// 终止条件
if (n == 0)
return res
@@ -1328,6 +1359,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="recursion.rb"
[class]{}-[func]{tail_recur}
```
=== "Zig"
```zig title="recursion.zig"
@@ -1554,6 +1591,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="recursion.rb"
[class]{}-[func]{fib}
```
=== "Zig"
```zig title="recursion.zig"
@@ -1890,6 +1933,12 @@ comments: true
}
```
=== "Ruby"
```ruby title="recursion.rb"
[class]{}-[func]{for_loop_recur}
```
=== "Zig"
```zig title="recursion.zig"

95
docs/chapter_computational_complexity/space_complexity.md
View File

@@ -318,6 +318,29 @@ comments: true
=== "Kotlin"
```kotlin title=""
/* 类 */
class Node(var _val: Int) {
var next: Node? = null
}
/* 函数 */
fun function(): Int {
// 执行某些操作...
return 0
}
fun algorithm(n: Int): Int { // 输入数据
val a = 0 // 暂存数据（常量）
var b = 0 // 暂存数据（变量）
val node = Node(0) // 暂存数据（对象）
val c = function() // 栈帧空间（调用函数）
return a + b + c // 输出数据
}
```
=== "Ruby"
```ruby title=""
```
@@ -470,6 +493,18 @@ comments: true
=== "Kotlin"
```kotlin title=""
fun algorithm(n: Int) {
val a = 0 // O(1)
val b = IntArray(10000) // O(1)
if (n > 10) {
val nums = IntArray(n) // O(n)
}
}
```
=== "Ruby"
```ruby title=""
```
@@ -683,7 +718,7 @@ comments: true
}
}
/* 递归 O(n) */
void recur(n: i32) {
fn recur(n: i32) {
if n == 1 {
return;
}
@@ -714,6 +749,26 @@ comments: true
=== "Kotlin"
```kotlin title=""
fun function(): Int {
// 执行某些操作
return 0
}
/* 循环 O(1) */
fun loop(n: Int) {
for (i in 0..<n) {
function()
}
}
/* 递归 O(n) */
fun recur(n: Int) {
if (n == 1) return
return recur(n - 1)
}
```
=== "Ruby"
```ruby title=""
```
@@ -1076,6 +1131,14 @@ $$
}
```
=== "Ruby"
```ruby title="space_complexity.rb"
[class]{}-[func]{function}
[class]{}-[func]{constant}
```
=== "Zig"
```zig title="space_complexity.zig"
@@ -1372,6 +1435,12 @@ $$
}
```
=== "Ruby"
```ruby title="space_complexity.rb"
[class]{}-[func]{linear}
```
=== "Zig"
```zig title="space_complexity.zig"
@@ -1548,6 +1617,12 @@ $$
}
```
=== "Ruby"
```ruby title="space_complexity.rb"
[class]{}-[func]{linear_recur}
```
=== "Zig"
```zig title="space_complexity.zig"
@@ -1782,6 +1857,12 @@ $$
}
```
=== "Ruby"
```ruby title="space_complexity.rb"
[class]{}-[func]{quadratic}
```
=== "Zig"
```zig title="space_complexity.zig"
@@ -1971,6 +2052,12 @@ $$
}
```
=== "Ruby"
```ruby title="space_complexity.rb"
[class]{}-[func]{quadratic_recur}
```
=== "Zig"
```zig title="space_complexity.zig"
@@ -2163,6 +2250,12 @@ $$
}
```
=== "Ruby"
```ruby title="space_complexity.rb"
[class]{}-[func]{build_tree}
```
=== "Zig"
```zig title="space_complexity.zig"

143
docs/chapter_computational_complexity/time_complexity.md
View File

@@ -178,6 +178,21 @@ comments: true
=== "Kotlin"
```kotlin title=""
// 在某运行平台下
fun algorithm(n: Int) {
var a = 2 // 1 ns
a = a + 1 // 1 ns
a = a * 2 // 10 ns
// 循环 n 次
for (i in 0..<n) { // 1 ns ，每轮都要执行 i++
println(0) // 5 ns
}
}
```
=== "Ruby"
```ruby title=""
```
@@ -442,6 +457,27 @@ $$
=== "Kotlin"
```kotlin title=""
// 算法 A 的时间复杂度：常数阶
fun algoritm_A(n: Int) {
println(0)
}
// 算法 B 的时间复杂度：线性阶
fun algorithm_B(n: Int) {
for (i in 0..<n){
println(0)
}
}
// 算法 C 的时间复杂度：常数阶
fun algorithm_C(n: Int) {
for (i in 0..<1000000) {
println(0)
}
}
```
=== "Ruby"
```ruby title=""
```
@@ -644,6 +680,20 @@ $$
=== "Kotlin"
```kotlin title=""
fun algorithm(n: Int) {
var a = 1 // +1
a = a + 1 // +1
a = a * 2 // +1
// 循环 n 次
for (i in 0..<n) { // +1（每轮都执行 i ++）
println(0) // +1
}
}
```
=== "Ruby"
```ruby title=""
```
@@ -909,6 +959,25 @@ $T(n)$ 是一次函数，说明其运行时间的增长趋势是线性的，因
=== "Kotlin"
```kotlin title=""
fun algorithm(n: Int) {
var a = 1 // +0（技巧 1）
a = a + n // +0（技巧 1）
// +n（技巧 2）
for (i in 0..<5 * n + 1) {
println(0)
}
// +n*n（技巧 3）
for (i in 0..<2 * n) {
for (j in 0..<n + 1) {
println(0)
}
}
}
```
=== "Ruby"
```ruby title=""
```
@@ -1144,6 +1213,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{constant}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -1316,6 +1391,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{linear}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -1503,6 +1584,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{array_traversal}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -1717,6 +1804,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{quadratic}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -2017,6 +2110,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{bubble_sort}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -2273,6 +2372,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{exponential}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -2436,6 +2541,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{exp_recur}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -2627,6 +2738,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{logarithmic}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -2784,6 +2901,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{log_recur}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -2992,6 +3115,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{linear_log_recur}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -3218,6 +3347,12 @@ $$
}
```
=== "Ruby"
```ruby title="time_complexity.rb"
[class]{}-[func]{factorial_recur}
```
=== "Zig"
```zig title="time_complexity.zig"
@@ -3607,6 +3742,14 @@ $$
}
```
=== "Ruby"
```ruby title="worst_best_time_complexity.rb"
[class]{}-[func]{random_numbers}
[class]{}-[func]{find_one}
```
=== "Zig"
```zig title="worst_best_time_complexity.zig"