Persiansort: an alternative to mergesort inspired by persian rug
Parviz Afereidoon

TL;DR
Persiansort is a new stable sorting algorithm inspired by Persian rugs that outperforms mergesort in nearly sorted data, uses less memory, and is flexible across various data types.
Contribution
It introduces persiansort, a novel sorting algorithm that overcomes mergesort's weaknesses and improves efficiency and memory usage.
Findings
Persiansort outperforms mergesort on most data types.
It is more memory-efficient than mergesort.
Persiansort is flexible and effective on nearly sorted data.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Advanced Database Systems and Queries · Advanced Clustering Algorithms Research
