Cyclic Partition

A new sequence partitioning technique called Cyclic Partition is presented as a more efficient alternative to the common Hoare partitioning scheme. The core innovation is reducing the number of assignments for each displaced value from one and a half down to approximately one. This is achieved by creating a chain of assignments, where a value is moved into the slot just emptied by the previous value, thus minimizing data movement operations. Benchmarking results demonstrate that this method significantly outperforms the Hoare scheme, particularly when working with large objects or when a high percentage of elements need to be repositioned during the partition.