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

fix(csharp): Modify method name to PascalCase, simplify new expression (#840)

Browse Source 
* Modify method name to PascalCase(array and linked list)

* Modify method name to PascalCase(backtracking)

* Modify method name to PascalCase(computational complexity)

* Modify method name to PascalCase(divide and conquer)

* Modify method name to PascalCase(dynamic programming)

* Modify method name to PascalCase(graph)

* Modify method name to PascalCase(greedy)

* Modify method name to PascalCase(hashing)

* Modify method name to PascalCase(heap)

* Modify method name to PascalCase(searching)

* Modify method name to PascalCase(sorting)

* Modify method name to PascalCase(stack and queue)

* Modify method name to PascalCase(tree)

* local check
This commit is contained in:
hpstory
2023-10-08 01:33:46 +08:00
committed by GitHub
parent 6f7e768cb7
commit f62256bee1
129 changed files with 1186 additions and 1192 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -8,20 +8,20 @@ namespace hello_algo.chapter_computational_complexity;
public class recursion {
/* 递归 */
public int recur(int n) {
public int Recur(int n) {
// 终止条件
if (n == 1)
return 1;
// 递：递归调用
int res = recur(n - 1);
int res = Recur(n - 1);
// 归：返回结果
return n + res;
}
/* 使用迭代模拟递归 */
public int forLoopRecur(int n) {
public static int ForLoopRecur(int n) {
// 使用一个显式的栈来模拟系统调用栈
Stack<int> stack = new Stack<int>();
Stack<int> stack = new();
int res = 0;
// 递：递归调用
for (int i = n; i > 0; i--) {
@ -38,21 +38,21 @@ public class recursion {
}
/* 尾递归 */
public int tailRecur(int n, int res) {
public int TailRecur(int n, int res) {
// 终止条件
if (n == 0)
return res;
// 尾递归调用
return tailRecur(n - 1, res + n);
return TailRecur(n - 1, res + n);
}
/* 斐波那契数列：递归 */
public int fib(int n) {
public int Fib(int n) {
// 终止条件 f(1) = 0, f(2) = 1
if (n == 1 || n == 2)
return n - 1;
// 递归调用 f(n) = f(n-1) + f(n-2)
int res = fib(n - 1) + fib(n - 2);
int res = Fib(n - 1) + Fib(n - 2);
// 返回结果 f(n)
return res;
}
@ -63,16 +63,16 @@ public class recursion {
int n = 5;
int res;
res = recur(n);
res = Recur(n);
Console.WriteLine("\n递归函数的求和结果 res = " + res);
res = forLoopRecur(n);
res = ForLoopRecur(n);
Console.WriteLine("\n使用迭代模拟递归求和结果 res = " + res);
res = tailRecur(n, 0);
res = TailRecur(n, 0);
Console.WriteLine("\n尾递归函数的求和结果 res = " + res);
res = fib(n);
res = Fib(n);
Console.WriteLine("\n斐波那契数列的第 " + n + " 项为 " + res);
}
}