algorithm - 功能替代品？

Question

随着我继续学习函数式编程，我来了 想知道是否可以替代我默认的“程序”方式 的思考。更具体地说，我在看一个函数 写了。这是它的作用:

Swap two elements of an unordered list of numbers, such that one of the elements  
 is now in the right place
Add the sum of the swapped values to an accumulated total   
Repeat until list is sorted

所以，现在我正在使用一个带有 accum 变量的标准循环*来做 以上。它工作正常，而且肯定没有错 与现实生活中的迭代，但作为这个练习的重点是 扩展我的思维方式，我很好奇是否有更实用的 上述算法的方法。

谢谢!

*(实际上是递归，但无论如何)

Answer 1

From EigenClass:

The venerable master Leroy was walking with his student. Wishing to start a discussion with his master, the apprentice said "Master, I've heard that all loops must be replaced with tail-recursive functions. Is that true?" Leroy looked commiseratively at his student and replied "Foolish pupil, many tail-recursive functions are merely inefficient loops."

The student spent the next few weeks replacing tail-recursive functions with explicit loops. He finally showed his code to master Leroy, seeking his approval. Leroy hit him with a stick. "When will you learn? Explicit loops are a poor man's tail-recursive functions." At that moment, the student became enlightened.

编辑:引用 OCaml 的主要开发人员 Xavier Leroy

因为我无法看到您的函数来理解它的功能*，所以我不知道。但看起来你所做的是正确的。我的主要建议是查看适合函数式编程的数据结构——但是您使用的是列表，所以这是不可能的，尽管在这种情况下列表不是最好的数据结构。以及算法。如果您沉迷于使用插入排序，那么您可能无法使用归并排序或其他更高效的方法。