Is this the simplest (and most surprising) sorting algorithm? (arxiv.org)

Article summary

The article presents a simple sorting algorithm that may appear incorrect at first glance but is proven to be correct. The algorithm is compared to other simple sorting algorithms and its properties are analyzed. The algorithm's simplicity and surprising nature are highlighted. The paper is available in various formats, including PDF and HTML.

Main themes

• sorting algorithms
• academic writing conventions
• array indexing
• algorithm analysis
• programming languages
• visualization tools
• authorship and language

What commenters say

• The algorithm may have been independently discovered by others in the past.
• The use of the plural form 'we' in the paper is a common and intentional choice in academic writing.
• The algorithm is not a variation of bubble sort, but rather a distinct sorting method.
• The algorithm's behavior is more similar to insertion sort than other sorting algorithms.
• The choice of array indexing, whether 0-based or 1-based, is a matter of convention and depends on the programming language or context.
• The algorithm's simplicity and elegance are notable, despite its potential inefficiency.
• The paper's authorship and use of language are subjects of discussion and interpretation.
• The visualization of the algorithm's behavior can help to understand its properties and differences from other sorting methods.