Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms (resit) / 8 / e

No: Stooge sort is not stable. Give equal keys distinct record identities and start withThe initial endpoint swap gives $[1,2_b,2_a]$. The later two-element calls either see increasing keys or equal keys, so they make no swap. The two records with key 2 have reversed their original order, contradicting stable sorting. The example uses length three, where the intended current-length split is unambiguous.