在C＃中使用递归时，代码是线性处理还是伪并行处理？

Question

I'm currently writing a program in C#, a language I'm not too familiar with, and I've been noticing some unexpected values when using recursion. My question is, when using recursion in C#, are the function calls thrown on the stack and processed like in Java, or does C# try and implement fork()/pthread pseudo parallelism to increase op time?

Answer 1

or does C# try and implement fork()/pthread pseudo parallelism to increase op time?

No. Each recursive call will be processed linearly. If you are calling your method from Parallel.For/Parallel.Foreach or in some other multi threaded way, then you can expect non linear execution.

Answer 2

Talking about C# and fork in the same sentence is kind of weird. Although alternatives exists to run .NET on Linux, it was created for Windows, since fork() is a POSIX system call (aka not Windows') your question lack of sense.

Besides that, there is nothing cleaver behind recursion in C#. Just normal methods calls pushed onto the stack. It doesn't even count with tail recursion .

Answer 3

C# does recursion just like any other C-like language: parameters get put on the stack and the method is called in order.

It is done the same way in C, C++, Java, ... besides recursion tends to be hard to parallelize because the result of call n tends to depend upon the results of call n+1 .

Answer 4

When you use recursion in C#, it is done in one thread. Just look at your call stack in debug mode to prove it to yourself