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

feat(csharp) .NET 8.0 code migration (#966)

Browse Source 
* .net 8.0 migration

* update docs

* revert change

* revert change and update appendix docs

* remove static

* Update binary_search_insertion.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
hpstory
2023-11-26 23:18:44 +08:00
committed by GitHub
parent d960c99a1f
commit 56b20eff36
93 changed files with 539 additions and 487 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/csharp/chapter_computational_complexity/recursion.cs
View File

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_computational_complexity;
public class recursion {
/* 递归 */
public int Recur(int n) {
int Recur(int n) {
// 终止条件
if (n == 1)
return 1;
@@ -19,7 +19,7 @@ public class recursion {
}
/* 使用迭代模拟递归 */
public static int ForLoopRecur(int n) {
int ForLoopRecur(int n) {
// 使用一个显式的栈来模拟系统调用栈
Stack<int> stack = new();
int res = 0;
@@ -38,7 +38,7 @@ public class recursion {
}
/* 尾递归 */
public int TailRecur(int n, int res) {
int TailRecur(int n, int res) {
// 终止条件
if (n == 0)
return res;
@@ -47,7 +47,7 @@ public class recursion {
}
/* 斐波那契数列：递归 */
public int Fib(int n) {
int Fib(int n) {
// 终止条件 f(1) = 0, f(2) = 1
if (n == 1 || n == 2)
return n - 1;