just some (maybe) usefull code
| Sort | Memory | Stable | adatability | Speed |
|---|---|---|---|---|
| blitsort | O(512) | yes | yes | adapts to sorted dataa |
| quadsort | O(n) | yes | yes | adapts to sorted data |
| piposort | O(n) | yes | yes | best for random data |
| powersort | O(n/2) | yes | yes | best for partially sorted |
| quickinsert | O(log n) (recursion calls) | no | no | best for random data, still slower than piposort |
| block_quicksort | O(log n) (recursion calls) | no | no | best for random data, branchless optimization. main loop of pdqsort |
piposort is a stable, outof-place, branchless comparison sort, faster than quicksort uses O(n) memory
powersort is a fast stable sorting algorithm used by cphyton
quicksort is faster but unstable
sparse set is usefull to keep track of entities by id even when deleting/inserting
fast iteration, because densly packed in data arr