blocks|key|2575206|text|将其转换为iterative+function.|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2575207|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/1549943/design-patterns-for-converting-recursive-algorithms-to-iterative-ones^0|5|J|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

Convert it to an <a href="https://stackoverflow.com/questions/1549943/design-patterns-for-converting-recursive-algorithms-to-iterative-ones">iterative function.</a>

blocks|key|1553156|text|不幸的是，C#编译器不执行tail+call+optimization，这是您希望在这种情况下发生的事情。CLR支持它，kinda，但你不应该依赖它。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1553157|也许在字段的左边，但也许你可以用F#编写程序的递归部分？这样，您就可以利用有保证的尾部调用优化，并重用C#代码的一小部分。虽然学习曲线很陡峭，但F#是一种更适合这些组合任务的语言。|1553158|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Tail_recursion|1|http://blogs.msdn.com/b/davbr/archive/2007/06/20/tail-call-jit-conditions.aspx^0|D|M|0|1O|5|1|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]|$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|6|7|W|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]|N|$5|I|J|K|C|$L|O]]]]

Unfortunately C# compiler does not perform <a href="http://en.wikipedia.org/wiki/Tail_recursion" rel="nofollow noreferrer">tail call optimization</a>, which is something that you want to happen in this case. CLR supports it, <a href="http://blogs.msdn.com/b/davbr/archive/2007/06/20/tail-call-jit-conditions.aspx" rel="nofollow noreferrer">kinda</a>, but you shouldn't rely on it.

Perhaps left of field, but maybe you can write the recursive part of your program in F#? This way you can leverage guaranteed tail call optimization and reuse bits of your C# code. Whilst a steep learning curve, F# is a more suitable language for these combinatorial tasks.

blocks|key|806677|text|嗯……我不确定我和你们谁一起去，但我有解决办法。我使用了多个进程，一个是与用户交互的进程，另一个是查找单词组合的进程。另一个过程找到5000个单词，保存它们并退出。通信是通过WCF实现的。当进程退出=释放内存时，这看起来很好。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|806678|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Well...I am not sure whom with I go amongst you but I got the solution. I am using more than one process one that is interacting with user and other for finding the words combination. The other process finds 5000 words, save them and quit. Communication is being achieved through WCF. This looks pretty fine as when process quits = frees memory.

blocks|key|803761|text|显然，您不能将中间结果存储在内存中(除非您有某种荒唐的计算机可供使用)；您必须将结果写入磁盘。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|803762|递归深度不是考虑的字符数的结果-它由您愿意考虑的最大字符串长度决定。|803763|例如，我安装的python+2.6.2的默认递归限制设置为1000。有争议的是，我应该能够在给定一个字符集的情况下生成所有可能的1-1000个长度的字符串(现在，我认为递归限制适用于总的堆栈深度，所以实际的限制可能小于1000)。|803764|python编辑(添加了示例)：以下python代码片段将生成您所要求的内容(将其自身限制为给定的运行时堆栈限制)：|offset|length|style|BOLD|803765|from+string+import+ascii_lowercase

def+generate(base="",+charset=ascii_lowercase):
++++for+c+in+charset:
++++++++next+=+base+%2B+c
++++++++yield+next
++++++++try:
++++++++++++for+s+in+generate(next,+charset):
++++++++++++++++yield+s
++++++++except:
++++++++++++continue

for+s+in+generate():
++++print+s|code-block|syntax|javascript|803766|通过在StackOverflowException上尝试/捕获，可以在C#中产生基本上相同的结果。当我输入此更新时，脚本正在运行，正在消耗我的一个内核。但是，内存使用率在小于7MB时是恒定的。现在，我只是打印到stdout，因为我对捕获结果不感兴趣，但我认为它证明了上面的观点。;)|803767|python的补充：有趣的注意:仔细观察正在运行的进程，python实际上与上面的示例绑定了I/O。它只使用了我7%25的CPU，而其余的内核则在我的命令窗口中渲染结果。最小化窗口允许python攀升到总CPU使用率的40%25，这是在双核计算机上实现的。|803768|entityMap^0|0|0|0|C|4|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|X|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Y|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|Z|8|@$H|10|I|11|J|K]]|9|@]|A|$]]|$1|L|3|M|5|N|7|12|8|@]|9|@]|A|$O|P]]|$1|Q|3|R|5|6|7|13|8|@]|9|@]|A|$]]|$1|S|3|T|5|6|7|14|8|@]|9|@]|A|$]]|$1|U|3|-4|5|6|7|15|8|@]|9|@]|A|$]]]|V|$]]

Well, you obviously cannot store the intermediate results in memory (unless you've got some sort of absurd computer at your disposal); you will have to write the results to disk. 

The recursion depth isn't a result of the number of considered characters - its determined by what the maximum string length you're willing to consider.

For instance, my install of python 2.6.2 has it's default recursion limit set to 1000. Arguable, I should be able to generate all possible 1-1000 length strings given a character set within this limitation (now, I think the recursion limit applies to total stack depth, so the actual limit may be less than 1000).

Edit (added python sample):
The following python snippet will produce what you're asking for (limiting itself to the given runtime stack limits):

<pre><code>from string import ascii_lowercase

def generate(base="", charset=ascii_lowercase):
 for c in charset:
 next = base + c
 yield next
 try:
 for s in generate(next, charset):
 yield s
 except:
 continue

for s in generate():
 print s
</code></pre>

One could produce essentially the same in C# by try/catching on StackOverflowException. As I'm typing this update, the script is running, chewing up one of my cores. However, memory usage is constant at less than 7MB. Now, I'm only print to stdout since I'm not interested in capturing the result, but I think it proves the point above. ;)

Addendum to the example:
Interesting note: Looking closer at running processes, python is actually I/O bound with the above example. It's only using 7% of my CPU, while the rest of the core is bound rending the results in my command window. Minimizing the window allows python to climb to 40% of total CPU usage, this is on a 2 core machine.

blocks|key|2575313|text|另一个注意事项:在C#中连接或使用其他方法生成字符串时，它会占用自己的内存，并且可能会停留一段时间。如果您正在生成数百万个字符串，您可能会注意到一些性能拖累。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2575314|如果您不需要保留许多字符串，我会看看是否有办法避免生成字符串。例如，如果您有一个字符数组，您可以在移动字符组合时不断更新它，如果您要将它们输出到一个文件中，则可以一次输出一个字符，这样就不必构建字符串。|2575315|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

One more consideration: When you concatenate or use some other method to generate a string in C#, it occupies its own memory and may stick around for a while. If you are generating millions of strings, you are likely to notice some performance drag.

If you don't need to keep your many strings around, I would see if there's away to avoid generating the strings. For example, maybe you have a character array that you keep updating as you move through the character combinations, and if you're outputting them to a file, you would output them one character at a time so you don't have to build the string.

I have written an application in C# that generates all the words that can be existed in the combination of alphabets, numbers and few special characters.

The problem is that it isn't memory efficient as it is adapting Recursion and also some collection like List.

Is there any way I can make it to run in limited memory environment?

Umair

Memory Efficient Recursion

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

我用C#编写了一个应用程序，它可以生成所有可以由字母、数字和一些特殊字符组合而成的单词。问题是它的内存效率不高，因为它正在适应递归和一些像List这样的集合。有没有办法让它在有限的内存环境中运行？乌马尔

问内存高效递归
EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问内存高效递归EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问内存高效递归
EN