AI Chat AI Image Generator AI Video Text to Speech

Loop Programming Practices that Simplify Quicksort Implementations

06/12/2019

∙

by Shoupu Wan, et al.

∙

∙

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.

page 2

page 3

research

∙ 09/29/2020

Iteration in ACL2

Iterative algorithms are traditionally expressed in ACL2 using recursion...

0 Matt Kaufmann, et al. ∙

research

∙ 08/07/2014

Random Algorithms for the Loop Cutset Problem

We show how to find a minimum loop cutset in a Bayesian network with hig...

0 Ann Becker, et al. ∙

research

∙ 06/01/2011

Randomized Algorithms for the Loop Cutset Problem

We show how to find a minimum weight loop cutset in a Bayesian network w...

0 R. Bar-Yehuda, et al. ∙

research

∙ 04/06/2019

On the Representation of Partially Specified Implementations and its Application to the Optimization of Linear Algebra Kernels on GPU

Traditional optimizing compilers rely on rewrite rules to iteratively ap...

0 Ulysse Beaugnon, et al. ∙

research

∙ 07/05/2023

Kolam Simulation using Angles at Lattice Points

Kolam is a ritual art form practised by people in South India and consis...

0 Tulasi Bharathi, et al. ∙

research

∙ 04/01/2019

Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version)

We propose a methodology for automatic generation of divide-and-conquer ...

0 Azadeh Farzan, et al. ∙

research

∙ 01/21/2019

Technical Report: Using Loop Scopes with for-Loops

Loop scopes have been shown to be a helpful tool in creating sound loop ...

0 Nathan Wasser, et al. ∙