如何合并排序的序列?

本文介绍了如何合并排序的序列?的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！

问题描述

这是我一直在努力解决的问题.我需要将两个排序的序列合并为一个排序的序列.理想情况下，该算法应该是延迟求值的，并且不需要从每个序列中缓存一个以上的项目.这不是一个很难解决的难题，而且我已经能够用F#设计许多解决方案.不幸的是，我想出的每个解决方案都存在以下几个问题之一.

Here’s a problem I’ve really been struggling with. I need to merge two sorted sequences into a single sorted sequence. Ideally, the algorithm should be lazy-evaluated, and not require caching more than one item from each sequence. This is not a terribly difficult problem to solve, and I’ve been able to engineer a number of solutions in F#. Unfortunately, every solution I’ve come up with has one of several problems.

使用yield！递归调用子序列生成器.这样可以产生美观的解决方案，但是为每个项目创建子序列都是性能杀手.

Recursive calls to subsequence generators using yield!. This produces elegant looking solutions, but the creation of a subsequence for every item is a performance killer.

真正的奥秘和不可维护的代码，带有深度堆叠的匹配开关，多个几乎完全相同的代码块等.

Really arcane and unmaintainable code with deeply-stacked match switches, multiple nearly identical blocks of code, etc.

强制F#进入纯程序模式(大量可变值等)的代码.

Code which forces F# into a purely procedural mode (lots of mutable values, etc.).

我能够在同一滩上找到创始人的所有在线示例.

And all of the online examples I've been able to find founder on the same shoals.

我是否遗漏了一些明显的东西:像是真的很简单，还是显然不可能?有谁知道一个真正优雅的解决方案，该解决方案也有效且功能强大? (它不必纯粹是功能.)否则，我可能最终会缓存子序列并使用列表或数组.

Am I missing something obvious: like it's either really simple or else obviously impossible? Does anyone know of a really elegant solution that is also efficient and mostly functional? (It doesn’t have to be purely functional.) If not, I may end up caching subsequences and using lists or arrays.

to

如何合并排序的序列?

问题描述

推荐答案