# Loop Programming Practices that Simplify Quicksort Implementations

## TL;DR

This paper introduces loop programming and refactoring techniques that simplify the implementation of Hoare's quicksort algorithm from nested loops to a single loop, enhancing clarity and potential for algorithm discovery.

## Contribution

It presents novel loop refactoring methods that reduce quicksort implementation complexity and can be applied to general programming and algorithm development.

## Key findings

- Simplified quicksort implementation with a single loop
- Techniques applicable to general programming practices
- Potential for discovering new algorithms through loop refactoring

## Abstract

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.