快速排序实现的循环编程实践
Loop Programming Practices that Simplify Quicksort Implementations
摘要:
Hoare划分方案的快速排序算法传统上是用嵌套循环实现的。在这篇文章中,我们提出了循环编程和重构技术,导致霍尔的快速排序算法由一个单一的循环简化实现。我们相信,这些技术是有益的一般编程,并可用于发现更新颖的算法。
英文摘要:
Quicksort algorithm with Hoare's partition scheme is traditionally implemented with nested loops. In this article, we present loop programming and refactoring techniques that lead to simplified implementation for Hoare's quicksort algorithm consisting of a single loop. We believe that the techniques are beneficial for general programming and may be used for the discovery of more novel algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。