格上的递归排序
Recursive Sorting in Lattices
摘要：
直接应用格中的排序定义是不切实际的，因为它会导致一个具有指数复杂度的算法。在本文中，我们提出了分配格的递归公式来计算序列的排序。这个替代公式的灵感来自于帕斯卡三角形的恒等式。它提供了二次复杂性，实际上是格的插入排序的推广。
英文摘要：
The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a sequence. This alternative formulation is inspired by the identity that underlies Pascal's triangle. It provides quadratic complexity and is in fact a generalization of insertion sort for lattices.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
