This paper introduces persiansort, new stable sorting algorithm inspired by Persian rug. Persiansort does not have the weaknesses of mergesort under scenarios involving nearly sorted and partially sorted data, also utilizing less auxiliary memory than mergesort and take advantage of runs. Initial experimental showed, this method is flexible, powerful and works better than mergesort in almost all types of data. Persiansort offers several advantages over merge methods make it a potential replacement.

翻译：本文介绍波斯排序，这是一种受波斯地毯启发的新型稳定排序算法。波斯排序在涉及近似有序和部分有序数据的场景下，克服了归并排序的弱点，同时比归并排序使用更少的辅助内存，并能有效利用数据中的有序段。初步实验表明，该方法具有灵活性和高效性，在几乎所有数据类型上的表现均优于归并排序。波斯排序相较于归并方法具备多项优势，使其成为潜在的替代方案。