Symmetry Partition Sort
| dc.creator | Chen, Jing-Chao | |
| dc.date | 2007-06-01 | |
| dc.date.accessioned | 2026-07-07T08:03:48Z | |
| dc.date.available | 2026-07-07T08:03:48Z | |
| dc.description | In this paper, we propose a useful replacement for quicksort-style utility functions. The replacement is called Symmetry Partition Sort, which has essentially the same principle as Proportion Extend Sort. The maximal difference between them is that the new algorithm always places already partially sorted inputs (used as a basis for the proportional extension) on both ends when entering the partition routine. This is advantageous to speeding up the partition routine. The library function based on the new algorithm is more attractive than Psort which is a library function introduced in 2004. Its implementation mechanism is simple. The source code is clearer. The speed is faster, with O(n log n) performance guarantee. Both the robustness and adaptivity are better. As a library function, it is competitive. | |
| dc.identifier | https://arxiv.org/abs/0706.0046 | |
| dc.identifier | http://arxiv.org/abs/0706.0046 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/129717 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Symmetry Partition Sort | |
| dc.type | text |